/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:33:12,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:33:12,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:33:12,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:33:12,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:33:12,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:33:12,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:33:12,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:33:12,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:33:12,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:33:12,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:33:12,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:33:12,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:33:12,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:33:12,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:33:12,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:33:12,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:33:12,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:33:12,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:33:12,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:33:12,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:33:12,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:33:12,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:33:12,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:33:12,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:33:12,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:33:12,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:33:12,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:33:12,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:33:12,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:33:12,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:33:12,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:33:12,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:33:12,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:33:12,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:33:12,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:33:12,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:33:12,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:33:12,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:33:12,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:33:12,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:33:12,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:33:12,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:33:12,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:33:12,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:33:12,916 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:33:12,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:33:12,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:33:12,916 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:33:12,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:33:12,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:33:12,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:33:12,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:33:12,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:33:12,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:33:12,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:33:12,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:33:12,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:33:12,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:33:12,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:33:12,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:33:12,918 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:33:12,918 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:33:12,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:33:12,918 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 19:33:13,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:33:13,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:33:13,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:33:13,122 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:33:13,125 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:33:13,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2022-03-15 19:33:13,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8dce369d/284ed9ab99324335a77fed3ec3f376bf/FLAG2ae985ac8 [2022-03-15 19:33:13,520 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:33:13,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2022-03-15 19:33:13,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8dce369d/284ed9ab99324335a77fed3ec3f376bf/FLAG2ae985ac8 [2022-03-15 19:33:13,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8dce369d/284ed9ab99324335a77fed3ec3f376bf [2022-03-15 19:33:13,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:33:13,536 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:33:13,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:33:13,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:33:13,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:33:13,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26dfad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13, skipping insertion in model container [2022-03-15 19:33:13,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:33:13,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:33:13,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2612,2625] [2022-03-15 19:33:13,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:33:13,707 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:33:13,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2612,2625] [2022-03-15 19:33:13,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:33:13,729 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:33:13,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13 WrapperNode [2022-03-15 19:33:13,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:33:13,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:33:13,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:33:13,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:33:13,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,753 INFO L137 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2022-03-15 19:33:13,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:33:13,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:33:13,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:33:13,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:33:13,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:33:13,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:33:13,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:33:13,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:33:13,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (1/1) ... [2022-03-15 19:33:13,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:33:13,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:13,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 19:33:13,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 19:33:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:33:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:33:13,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:33:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:33:13,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:33:13,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:33:13,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:33:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:33:13,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:33:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:33:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:33:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:33:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:33:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:33:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:33:13,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:33:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:33:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:33:13,823 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:33:13,876 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:33:13,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:33:14,081 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:33:14,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:33:14,109 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:33:14,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:33:14 BoogieIcfgContainer [2022-03-15 19:33:14,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:33:14,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:33:14,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:33:14,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:33:14,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:33:13" (1/3) ... [2022-03-15 19:33:14,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5c7a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:33:14, skipping insertion in model container [2022-03-15 19:33:14,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:33:13" (2/3) ... [2022-03-15 19:33:14,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5c7a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:33:14, skipping insertion in model container [2022-03-15 19:33:14,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:33:14" (3/3) ... [2022-03-15 19:33:14,122 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2022-03-15 19:33:14,125 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:33:14,125 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:33:14,125 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:33:14,125 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:33:14,155 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,155 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,155 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,156 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,156 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,156 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,157 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,157 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,158 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,158 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,158 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,158 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,162 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,163 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,163 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,163 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,163 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,164 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,164 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,164 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,164 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,164 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,165 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,165 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,165 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,165 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,167 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,167 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,167 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,167 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,167 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,168 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,168 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,168 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,168 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,168 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,170 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,170 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,174 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,175 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,176 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,176 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,176 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:33:14,179 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 19:33:14,210 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:33:14,215 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:33:14,215 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 19:33:14,224 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:33:14,229 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 133 transitions, 298 flow [2022-03-15 19:33:14,231 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 133 transitions, 298 flow [2022-03-15 19:33:14,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 136 places, 133 transitions, 298 flow [2022-03-15 19:33:14,287 INFO L129 PetriNetUnfolder]: 10/129 cut-off events. [2022-03-15 19:33:14,287 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:33:14,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 129 events. 10/129 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 95 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-03-15 19:33:14,296 INFO L116 LiptonReduction]: Number of co-enabled transitions 2520 [2022-03-15 19:33:17,098 INFO L131 LiptonReduction]: Checked pairs total: 2607 [2022-03-15 19:33:17,099 INFO L133 LiptonReduction]: Total number of compositions: 112 [2022-03-15 19:33:17,116 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 100 flow [2022-03-15 19:33:17,151 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 322 states, 321 states have (on average 4.040498442367602) internal successors, (1297), 321 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 321 states have (on average 4.040498442367602) internal successors, (1297), 321 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:33:17,164 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:17,164 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:17,165 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1020723403, now seen corresponding path program 1 times [2022-03-15 19:33:17,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:17,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350982478] [2022-03-15 19:33:17,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:17,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:17,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:17,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350982478] [2022-03-15 19:33:17,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350982478] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:33:17,423 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:33:17,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:33:17,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1236235527] [2022-03-15 19:33:17,424 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:17,430 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:17,512 INFO L252 McrAutomatonBuilder]: Finished intersection with 322 states and 945 transitions. [2022-03-15 19:33:17,513 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:21,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:33:21,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:33:21,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:21,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:33:21,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:33:21,122 INFO L87 Difference]: Start difference. First operand has 322 states, 321 states have (on average 4.040498442367602) internal successors, (1297), 321 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:21,172 INFO L93 Difference]: Finished difference Result 609 states and 2288 transitions. [2022-03-15 19:33:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:33:21,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:33:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:21,183 INFO L225 Difference]: With dead ends: 609 [2022-03-15 19:33:21,183 INFO L226 Difference]: Without dead ends: 554 [2022-03-15 19:33:21,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:33:21,185 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:21,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:33:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-03-15 19:33:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2022-03-15 19:33:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 3.815551537070524) internal successors, (2110), 553 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 2110 transitions. [2022-03-15 19:33:21,248 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 2110 transitions. Word has length 25 [2022-03-15 19:33:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:21,248 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 2110 transitions. [2022-03-15 19:33:21,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 2110 transitions. [2022-03-15 19:33:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:33:21,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:21,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:21,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:33:21,255 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1749564174, now seen corresponding path program 1 times [2022-03-15 19:33:21,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:21,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493186181] [2022-03-15 19:33:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:21,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:21,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:21,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493186181] [2022-03-15 19:33:21,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493186181] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:33:21,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:33:21,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:33:21,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1401129969] [2022-03-15 19:33:21,379 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:21,382 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:21,470 INFO L252 McrAutomatonBuilder]: Finished intersection with 402 states and 1214 transitions. [2022-03-15 19:33:21,470 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:23,994 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2510#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 2507#(<= (mod ~N~0 4294967296) 0), 2508#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 2509#(or (<= (mod ~N~0 4294967296) 0) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)))] [2022-03-15 19:33:23,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:33:23,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:23,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:33:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:33:23,996 INFO L87 Difference]: Start difference. First operand 554 states and 2110 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:24,132 INFO L93 Difference]: Finished difference Result 640 states and 2412 transitions. [2022-03-15 19:33:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:33:24,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:33:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:24,135 INFO L225 Difference]: With dead ends: 640 [2022-03-15 19:33:24,135 INFO L226 Difference]: Without dead ends: 546 [2022-03-15 19:33:24,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 304 SyntacticMatches, 69 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:33:24,137 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 47 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:24,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 50 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:33:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-03-15 19:33:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2022-03-15 19:33:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.8825688073394495) internal successors, (2116), 545 states have internal predecessors, (2116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 2116 transitions. [2022-03-15 19:33:24,148 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 2116 transitions. Word has length 26 [2022-03-15 19:33:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:24,149 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 2116 transitions. [2022-03-15 19:33:24,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 2116 transitions. [2022-03-15 19:33:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:33:24,150 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:24,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:24,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:33:24,151 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1178177895, now seen corresponding path program 1 times [2022-03-15 19:33:24,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:24,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498380597] [2022-03-15 19:33:24,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:24,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:24,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498380597] [2022-03-15 19:33:24,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498380597] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:24,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138835189] [2022-03-15 19:33:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:24,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:24,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:24,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:33:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:24,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:33:24,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:24,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:24,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138835189] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:24,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:33:24,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-03-15 19:33:24,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1665222650] [2022-03-15 19:33:24,395 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:24,398 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:24,496 INFO L252 McrAutomatonBuilder]: Finished intersection with 420 states and 1248 transitions. [2022-03-15 19:33:24,496 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:26,929 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [4406#(or (<= (mod ~N~0 4294967296) 0) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 4405#(<= (mod ~N~0 4294967296) 0)] [2022-03-15 19:33:26,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:33:26,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:26,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:33:26,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:33:26,931 INFO L87 Difference]: Start difference. First operand 546 states and 2116 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:27,036 INFO L93 Difference]: Finished difference Result 642 states and 2494 transitions. [2022-03-15 19:33:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:33:27,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:33:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:27,040 INFO L225 Difference]: With dead ends: 642 [2022-03-15 19:33:27,040 INFO L226 Difference]: Without dead ends: 602 [2022-03-15 19:33:27,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 397 SyntacticMatches, 46 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:33:27,041 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:27,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 47 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:33:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-03-15 19:33:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2022-03-15 19:33:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 3.9367720465890184) internal successors, (2366), 601 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 2366 transitions. [2022-03-15 19:33:27,053 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 2366 transitions. Word has length 27 [2022-03-15 19:33:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:27,054 INFO L470 AbstractCegarLoop]: Abstraction has 602 states and 2366 transitions. [2022-03-15 19:33:27,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 2366 transitions. [2022-03-15 19:33:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:33:27,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:27,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:27,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:27,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:27,264 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 16633029, now seen corresponding path program 1 times [2022-03-15 19:33:27,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:27,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157169363] [2022-03-15 19:33:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:27,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:27,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157169363] [2022-03-15 19:33:27,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157169363] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:27,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434907521] [2022-03-15 19:33:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:27,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:27,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:27,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:27,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:33:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:27,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:33:27,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:27,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:27,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434907521] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:27,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:33:27,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-03-15 19:33:27,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2060837650] [2022-03-15 19:33:27,535 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:27,539 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:27,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 404 states and 1162 transitions. [2022-03-15 19:33:27,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:30,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6422#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 6421#(<= (mod ~N~0 4294967296) 0)] [2022-03-15 19:33:30,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:33:30,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:30,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:33:30,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:33:30,339 INFO L87 Difference]: Start difference. First operand 602 states and 2366 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:30,449 INFO L93 Difference]: Finished difference Result 722 states and 2858 transitions. [2022-03-15 19:33:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:33:30,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:33:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:30,453 INFO L225 Difference]: With dead ends: 722 [2022-03-15 19:33:30,453 INFO L226 Difference]: Without dead ends: 698 [2022-03-15 19:33:30,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 371 SyntacticMatches, 57 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:33:30,454 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:30,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 39 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:33:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-03-15 19:33:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2022-03-15 19:33:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 3.9971305595408895) internal successors, (2786), 697 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2786 transitions. [2022-03-15 19:33:30,474 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2786 transitions. Word has length 28 [2022-03-15 19:33:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:30,474 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 2786 transitions. [2022-03-15 19:33:30,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2786 transitions. [2022-03-15 19:33:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:33:30,478 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:30,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:30,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:30,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 19:33:30,684 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:30,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash -857299128, now seen corresponding path program 1 times [2022-03-15 19:33:30,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:30,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144178249] [2022-03-15 19:33:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:30,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:30,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144178249] [2022-03-15 19:33:30,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144178249] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:33:30,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:33:30,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:33:30,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1221586046] [2022-03-15 19:33:30,759 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:30,761 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:30,816 INFO L252 McrAutomatonBuilder]: Finished intersection with 374 states and 1074 transitions. [2022-03-15 19:33:30,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:33,525 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [8549#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= 0 (div (+ (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296))), 8548#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 8553#(or (< 0 (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)), 8551#(and (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ (* (div thread3Thread1of1ForFork1_~i~2 4294967296) 4294967296) ~N~0) (* (div ~N~0 4294967296) 4294967296)))), 8547#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= 0 (div (+ (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296))), 8550#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 8546#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 8552#(< 0 (mod ~N~0 4294967296))] [2022-03-15 19:33:33,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:33:33,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:33:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:33:33,526 INFO L87 Difference]: Start difference. First operand 698 states and 2786 transitions. Second operand has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:33,797 INFO L93 Difference]: Finished difference Result 778 states and 3118 transitions. [2022-03-15 19:33:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:33:33,797 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:33:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:33,801 INFO L225 Difference]: With dead ends: 778 [2022-03-15 19:33:33,801 INFO L226 Difference]: Without dead ends: 732 [2022-03-15 19:33:33,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 327 SyntacticMatches, 17 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:33:33,802 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 125 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:33,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 84 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:33:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-03-15 19:33:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2022-03-15 19:33:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 4.093023255813954) internal successors, (2992), 731 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2992 transitions. [2022-03-15 19:33:33,825 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2992 transitions. Word has length 28 [2022-03-15 19:33:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:33,825 INFO L470 AbstractCegarLoop]: Abstraction has 732 states and 2992 transitions. [2022-03-15 19:33:33,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2992 transitions. [2022-03-15 19:33:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:33:33,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:33,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:33,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:33:33,829 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:33,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1533652487, now seen corresponding path program 1 times [2022-03-15 19:33:33,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:33,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080435791] [2022-03-15 19:33:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:33,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:33,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:33,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080435791] [2022-03-15 19:33:33,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080435791] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:33,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474420162] [2022-03-15 19:33:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:33,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:33,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:33,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:33,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:33:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:34,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:33:34,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:34,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:34,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474420162] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:34,167 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:34,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-03-15 19:33:34,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1231866677] [2022-03-15 19:33:34,167 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:34,170 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:34,225 INFO L252 McrAutomatonBuilder]: Finished intersection with 356 states and 976 transitions. [2022-03-15 19:33:34,225 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:38,954 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [10987#(or (<= (mod ~counter~0 4294967296) 0) (<= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))), 10989#(and (or (<= (mod ~counter~0 4294967296) 0) (<= ~counter~0 ~c~0)) (or (<= (mod ~counter~0 4294967296) 0) (<= ~c~0 ~counter~0))), 10990#(and (or (<= (mod (+ ~counter~0 ~c~0) 4294967296) 0) (<= 0 ~counter~0)) (or (<= (mod (+ ~counter~0 ~c~0) 4294967296) 0) (<= ~counter~0 0))), 10988#(or (<= (mod (+ ~counter~0 ~c~0) 4294967296) 0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))] [2022-03-15 19:33:38,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:33:38,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:38,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:33:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:33:38,955 INFO L87 Difference]: Start difference. First operand 732 states and 2992 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:39,080 INFO L93 Difference]: Finished difference Result 1819 states and 7091 transitions. [2022-03-15 19:33:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:33:39,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:33:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:39,089 INFO L225 Difference]: With dead ends: 1819 [2022-03-15 19:33:39,089 INFO L226 Difference]: Without dead ends: 1706 [2022-03-15 19:33:39,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 366 SyntacticMatches, 11 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:33:39,090 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 92 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:39,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 32 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:33:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2022-03-15 19:33:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1490. [2022-03-15 19:33:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1489 states have (on average 4.09670920080591) internal successors, (6100), 1489 states have internal predecessors, (6100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 6100 transitions. [2022-03-15 19:33:39,137 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 6100 transitions. Word has length 29 [2022-03-15 19:33:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:39,139 INFO L470 AbstractCegarLoop]: Abstraction has 1490 states and 6100 transitions. [2022-03-15 19:33:39,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 6100 transitions. [2022-03-15 19:33:39,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:33:39,146 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:39,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:39,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:39,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:39,363 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:39,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1597054401, now seen corresponding path program 2 times [2022-03-15 19:33:39,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:39,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766835506] [2022-03-15 19:33:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:39,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:39,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:39,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766835506] [2022-03-15 19:33:39,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766835506] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:39,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8723946] [2022-03-15 19:33:39,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:33:39,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:39,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:39,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:39,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:33:39,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:33:39,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:39,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:33:39,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:39,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:39,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8723946] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:39,694 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:39,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-03-15 19:33:39,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [581122893] [2022-03-15 19:33:39,694 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:39,696 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:39,754 INFO L252 McrAutomatonBuilder]: Finished intersection with 340 states and 936 transitions. [2022-03-15 19:33:39,754 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:43,383 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [15967#(and (or (<= (mod ~counter~0 4294967296) 0) (<= ~counter~0 (* 2 ~c~0))) (or (<= (mod ~counter~0 4294967296) 0) (<= (* 2 ~c~0) ~counter~0))), 15966#(or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (<= (mod ~counter~0 4294967296) 0))] [2022-03-15 19:33:43,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:33:43,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:33:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:33:43,385 INFO L87 Difference]: Start difference. First operand 1490 states and 6100 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:43,544 INFO L93 Difference]: Finished difference Result 3123 states and 12481 transitions. [2022-03-15 19:33:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:33:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:33:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:43,559 INFO L225 Difference]: With dead ends: 3123 [2022-03-15 19:33:43,559 INFO L226 Difference]: Without dead ends: 2990 [2022-03-15 19:33:43,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 360 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:33:43,560 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 81 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:43,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 40 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:33:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2022-03-15 19:33:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2064. [2022-03-15 19:33:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 2063 states have (on average 4.160930683470673) internal successors, (8584), 2063 states have internal predecessors, (8584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 8584 transitions. [2022-03-15 19:33:43,613 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 8584 transitions. Word has length 29 [2022-03-15 19:33:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:43,614 INFO L470 AbstractCegarLoop]: Abstraction has 2064 states and 8584 transitions. [2022-03-15 19:33:43,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 8584 transitions. [2022-03-15 19:33:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:33:43,620 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:43,620 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:43,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:43,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:43,838 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:43,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1536862880, now seen corresponding path program 3 times [2022-03-15 19:33:43,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:43,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315640661] [2022-03-15 19:33:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:43,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:43,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315640661] [2022-03-15 19:33:43,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315640661] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:43,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016764162] [2022-03-15 19:33:43,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:33:43,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:43,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:43,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:43,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:33:44,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:33:44,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:44,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:33:44,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:44,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:44,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016764162] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:44,195 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:44,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-03-15 19:33:44,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [430517532] [2022-03-15 19:33:44,195 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:44,198 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:44,285 INFO L252 McrAutomatonBuilder]: Finished intersection with 386 states and 1062 transitions. [2022-03-15 19:33:44,286 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:48,303 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [23411#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 23412#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 23413#(or (<= (mod ~N~0 4294967296) 0) (< 1 (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 23420#(and (or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 23417#(or (<= (mod ~N~0 4294967296) 1) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< 2 (mod ~N~0 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 23406#(<= (mod ~N~0 4294967296) 0), 23408#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 23407#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 23418#(and (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)) (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (not (<= (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1) 0)))), 23419#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))) (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), 23415#(or (< 1 (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 23410#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 23421#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 23416#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 23423#(or (<= (mod ~N~0 4294967296) 1) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (< 2 (mod ~N~0 4294967296))), 23422#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))), 23414#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 23409#(or (<= (mod ~N~0 4294967296) 0) (< 1 (mod ~N~0 4294967296)))] [2022-03-15 19:33:48,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:33:48,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:48,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:33:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:33:48,305 INFO L87 Difference]: Start difference. First operand 2064 states and 8584 transitions. Second operand has 24 states, 24 states have (on average 7.375) internal successors, (177), 24 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:52,788 INFO L93 Difference]: Finished difference Result 7928 states and 33028 transitions. [2022-03-15 19:33:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 19:33:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.375) internal successors, (177), 24 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:33:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:52,825 INFO L225 Difference]: With dead ends: 7928 [2022-03-15 19:33:52,825 INFO L226 Difference]: Without dead ends: 7808 [2022-03-15 19:33:52,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 432 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1016, Invalid=4836, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 19:33:52,827 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 612 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:52,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 393 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 19:33:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7808 states. [2022-03-15 19:33:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7808 to 3348. [2022-03-15 19:33:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3348 states, 3347 states have (on average 4.472960860472065) internal successors, (14971), 3347 states have internal predecessors, (14971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 14971 transitions. [2022-03-15 19:33:52,955 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 14971 transitions. Word has length 30 [2022-03-15 19:33:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:52,955 INFO L470 AbstractCegarLoop]: Abstraction has 3348 states and 14971 transitions. [2022-03-15 19:33:52,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.375) internal successors, (177), 24 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 14971 transitions. [2022-03-15 19:33:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:33:52,963 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:52,963 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:52,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:53,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:53,179 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:53,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1947104069, now seen corresponding path program 4 times [2022-03-15 19:33:53,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:53,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581647252] [2022-03-15 19:33:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:53,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:53,266 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:53,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581647252] [2022-03-15 19:33:53,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581647252] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:53,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015017450] [2022-03-15 19:33:53,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:33:53,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:53,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:53,267 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:53,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:33:53,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:33:53,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:53,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:33:53,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:53,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:53,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015017450] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:53,488 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:53,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 19:33:53,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176733836] [2022-03-15 19:33:53,488 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:53,491 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:53,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 392 states and 1082 transitions. [2022-03-15 19:33:53,555 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:57,860 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [38386#(or (<= (mod ~N~0 4294967296) 1) (< 2 (mod ~N~0 4294967296))), 38372#(<= (mod ~N~0 4294967296) 0), 38375#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) (mod ~N~0 4294967296))), 38379#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 38378#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 38373#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 38382#(and (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)) (<= 0 (div (+ (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296) 1) 4294967296))), 38376#(or (< (mod (+ 2 thread3Thread1of1ForFork1_~i~2) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296))), 38385#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 0 (div (+ (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296) 1) 4294967296))), 38380#(and (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= 0 (div (+ (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296) 1) 4294967296)))), 38384#(and (or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 0 (div (+ (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296) 1) 4294967296)))), 38374#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 38377#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 38381#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= 0 (div (+ (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296) 1) 4294967296))), 38387#(or (<= (mod ~N~0 4294967296) 0) (< 1 (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)), 38383#(and (or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= 0 (div (+ (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296) 1) 4294967296))))] [2022-03-15 19:33:57,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:33:57,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:57,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:33:57,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:33:57,862 INFO L87 Difference]: Start difference. First operand 3348 states and 14971 transitions. Second operand has 23 states, 23 states have (on average 7.565217391304348) internal successors, (174), 23 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:59,514 INFO L93 Difference]: Finished difference Result 7490 states and 30888 transitions. [2022-03-15 19:33:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:33:59,515 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.565217391304348) internal successors, (174), 23 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:33:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:59,538 INFO L225 Difference]: With dead ends: 7490 [2022-03-15 19:33:59,538 INFO L226 Difference]: Without dead ends: 6960 [2022-03-15 19:33:59,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 395 SyntacticMatches, 28 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=448, Invalid=2102, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:33:59,540 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 398 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:59,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 313 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:33:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2022-03-15 19:33:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 4104. [2022-03-15 19:33:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4104 states, 4103 states have (on average 4.532780892030222) internal successors, (18598), 4103 states have internal predecessors, (18598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 18598 transitions. [2022-03-15 19:33:59,665 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 18598 transitions. Word has length 30 [2022-03-15 19:33:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:59,665 INFO L470 AbstractCegarLoop]: Abstraction has 4104 states and 18598 transitions. [2022-03-15 19:33:59,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.565217391304348) internal successors, (174), 23 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 18598 transitions. [2022-03-15 19:33:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:33:59,677 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:59,677 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:59,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:59,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:59,891 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:33:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -984423822, now seen corresponding path program 5 times [2022-03-15 19:33:59,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:59,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944794095] [2022-03-15 19:33:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:59,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:59,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944794095] [2022-03-15 19:33:59,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944794095] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:59,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998999431] [2022-03-15 19:33:59,982 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:33:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:59,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:59,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:59,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:34:00,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:34:00,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:00,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:34:00,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:00,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:00,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998999431] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:00,266 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:00,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-03-15 19:34:00,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [838049575] [2022-03-15 19:34:00,268 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:00,270 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:00,327 INFO L252 McrAutomatonBuilder]: Finished intersection with 338 states and 910 transitions. [2022-03-15 19:34:00,327 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:03,550 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [54347#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 54352#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 54346#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 54350#(or (<= (mod ~N~0 4294967296) 1) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< 2 (mod ~N~0 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 54345#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 54327#(or (< 1 (mod ~N~0 4294967296)) (not (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)))), 54348#(<= (mod ~N~0 4294967296) 0), 54351#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 54344#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 54349#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 54353#(<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)), 54343#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 54315#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))] [2022-03-15 19:34:03,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:34:03,550 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:03,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:34:03,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:34:03,551 INFO L87 Difference]: Start difference. First operand 4104 states and 18598 transitions. Second operand has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 19 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:05,313 INFO L93 Difference]: Finished difference Result 8964 states and 38283 transitions. [2022-03-15 19:34:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:34:05,314 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 19 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:34:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:05,341 INFO L225 Difference]: With dead ends: 8964 [2022-03-15 19:34:05,341 INFO L226 Difference]: Without dead ends: 8802 [2022-03-15 19:34:05,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 362 SyntacticMatches, 13 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=593, Invalid=2059, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:34:05,342 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 391 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:05,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 171 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:34:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8802 states. [2022-03-15 19:34:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8802 to 4986. [2022-03-15 19:34:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4986 states, 4985 states have (on average 4.597793380140422) internal successors, (22920), 4985 states have internal predecessors, (22920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 22920 transitions. [2022-03-15 19:34:05,494 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 22920 transitions. Word has length 30 [2022-03-15 19:34:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:05,494 INFO L470 AbstractCegarLoop]: Abstraction has 4986 states and 22920 transitions. [2022-03-15 19:34:05,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 19 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 22920 transitions. [2022-03-15 19:34:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:34:05,508 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:05,508 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:05,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:05,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:05,724 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash 375847047, now seen corresponding path program 6 times [2022-03-15 19:34:05,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:05,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764247593] [2022-03-15 19:34:05,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:05,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:05,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764247593] [2022-03-15 19:34:05,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764247593] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:05,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662207524] [2022-03-15 19:34:05,813 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:34:05,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:05,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:05,815 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:05,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:34:05,945 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:34:05,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:05,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:34:05,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:06,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:06,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662207524] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:06,121 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:06,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-03-15 19:34:06,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1105699758] [2022-03-15 19:34:06,122 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:06,125 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:06,175 INFO L252 McrAutomatonBuilder]: Finished intersection with 292 states and 770 transitions. [2022-03-15 19:34:06,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:08,236 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [73563#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 73568#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 73565#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 73567#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296))), 73564#(<= (mod ~N~0 4294967296) 0), 73561#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 73569#(or (< 1 (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296))), 73562#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 73570#(<= (+ (* (div thread3Thread1of1ForFork1_~i~2 4294967296) 4294967296) 1) thread3Thread1of1ForFork1_~i~2), 73566#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) (mod ~N~0 4294967296)))] [2022-03-15 19:34:08,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:34:08,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:08,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:34:08,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:34:08,238 INFO L87 Difference]: Start difference. First operand 4986 states and 22920 transitions. Second operand has 16 states, 16 states have (on average 8.3125) internal successors, (133), 16 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:09,193 INFO L93 Difference]: Finished difference Result 11300 states and 49514 transitions. [2022-03-15 19:34:09,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:34:09,194 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.3125) internal successors, (133), 16 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:34:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:09,228 INFO L225 Difference]: With dead ends: 11300 [2022-03-15 19:34:09,228 INFO L226 Difference]: Without dead ends: 11086 [2022-03-15 19:34:09,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 296 SyntacticMatches, 22 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=1521, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:34:09,229 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 245 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:09,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 141 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:34:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11086 states. [2022-03-15 19:34:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11086 to 6620. [2022-03-15 19:34:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6620 states, 6619 states have (on average 4.757516241124037) internal successors, (31490), 6619 states have internal predecessors, (31490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 31490 transitions. [2022-03-15 19:34:09,416 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 31490 transitions. Word has length 30 [2022-03-15 19:34:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:09,416 INFO L470 AbstractCegarLoop]: Abstraction has 6620 states and 31490 transitions. [2022-03-15 19:34:09,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.3125) internal successors, (133), 16 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 31490 transitions. [2022-03-15 19:34:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:34:09,432 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:09,432 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:09,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:09,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 19:34:09,648 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2016501181, now seen corresponding path program 7 times [2022-03-15 19:34:09,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:09,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452278288] [2022-03-15 19:34:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:09,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:09,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:09,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452278288] [2022-03-15 19:34:09,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452278288] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:09,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549550961] [2022-03-15 19:34:09,726 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:34:09,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:09,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:09,727 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:09,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:34:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:09,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:34:09,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:09,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:09,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549550961] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:09,997 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:09,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-03-15 19:34:09,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [575883699] [2022-03-15 19:34:09,997 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:10,000 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:10,051 INFO L252 McrAutomatonBuilder]: Finished intersection with 320 states and 872 transitions. [2022-03-15 19:34:10,051 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:12,614 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [98354#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 98359#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), 98353#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 98361#(or (< 1 (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296))), 98360#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 98362#(<= (+ (* (div thread3Thread1of1ForFork1_~i~2 4294967296) 4294967296) 1) thread3Thread1of1ForFork1_~i~2), 98356#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 98352#(<= (mod ~N~0 4294967296) 0), 98357#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 98355#(or (<= (mod ~N~0 4294967296) 0) (< 1 (mod ~N~0 4294967296))), 98358#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)))] [2022-03-15 19:34:12,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:34:12,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:34:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:34:12,615 INFO L87 Difference]: Start difference. First operand 6620 states and 31490 transitions. Second operand has 17 states, 17 states have (on average 8.705882352941176) internal successors, (148), 17 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:13,647 INFO L93 Difference]: Finished difference Result 11658 states and 52647 transitions. [2022-03-15 19:34:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:34:13,647 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.705882352941176) internal successors, (148), 17 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:34:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:13,684 INFO L225 Difference]: With dead ends: 11658 [2022-03-15 19:34:13,684 INFO L226 Difference]: Without dead ends: 11542 [2022-03-15 19:34:13,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 337 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:34:13,685 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 155 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:13,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 246 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:34:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11542 states. [2022-03-15 19:34:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11542 to 6654. [2022-03-15 19:34:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6654 states, 6653 states have (on average 4.736209228919285) internal successors, (31510), 6653 states have internal predecessors, (31510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6654 states to 6654 states and 31510 transitions. [2022-03-15 19:34:13,889 INFO L78 Accepts]: Start accepts. Automaton has 6654 states and 31510 transitions. Word has length 30 [2022-03-15 19:34:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:13,889 INFO L470 AbstractCegarLoop]: Abstraction has 6654 states and 31510 transitions. [2022-03-15 19:34:13,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.705882352941176) internal successors, (148), 17 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6654 states and 31510 transitions. [2022-03-15 19:34:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:34:13,906 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:13,906 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:13,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:14,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:14,112 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash 23719798, now seen corresponding path program 8 times [2022-03-15 19:34:14,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:14,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222619261] [2022-03-15 19:34:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:14,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:14,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222619261] [2022-03-15 19:34:14,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222619261] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:14,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090577396] [2022-03-15 19:34:14,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:34:14,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:14,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:14,223 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:14,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:34:14,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:34:14,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:14,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:34:14,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:14,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:14,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090577396] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:14,498 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:14,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-03-15 19:34:14,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1974399820] [2022-03-15 19:34:14,499 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:14,501 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:14,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 320 states and 884 transitions. [2022-03-15 19:34:14,554 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:17,795 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [123586#(= thread3Thread1of1ForFork1_~i~2 0), 123568#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 123578#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 123576#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 123577#(or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))), 123572#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 123571#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 123563#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 123585#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), 123581#(<= (mod ~N~0 4294967296) 1), 123569#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 123570#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 123574#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 123582#(and (< 0 (+ (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1)) (<= 0 (div (+ (* (- 1) |thread2Thread1of1ForFork0_~i~1#1|) 1) 4294967296))), 123580#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) 1) (< 2 (mod ~N~0 4294967296))), 123579#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 123567#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 123564#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))), 123565#(or (<= (mod ~N~0 4294967296) 1) (< 2 (mod ~N~0 4294967296))), 123583#(or (<= (mod ~N~0 4294967296) 1) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< 2 (mod ~N~0 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 123584#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 123566#(<= (mod ~N~0 4294967296) 0), 123575#(<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)), 123573#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))), 123562#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))] [2022-03-15 19:34:17,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:34:17,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:34:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:34:17,796 INFO L87 Difference]: Start difference. First operand 6654 states and 31510 transitions. Second operand has 33 states, 33 states have (on average 7.212121212121212) internal successors, (238), 33 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:22,528 INFO L93 Difference]: Finished difference Result 14038 states and 61232 transitions. [2022-03-15 19:34:22,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 19:34:22,528 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.212121212121212) internal successors, (238), 33 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:34:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:22,565 INFO L225 Difference]: With dead ends: 14038 [2022-03-15 19:34:22,565 INFO L226 Difference]: Without dead ends: 13946 [2022-03-15 19:34:22,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 373 SyntacticMatches, 15 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3930 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1714, Invalid=11168, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 19:34:22,568 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 576 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 3856 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 4028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 3856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:22,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 587 Invalid, 4028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 3856 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 19:34:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13946 states. [2022-03-15 19:34:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13946 to 7592. [2022-03-15 19:34:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7592 states, 7591 states have (on average 4.77130812804637) internal successors, (36219), 7591 states have internal predecessors, (36219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7592 states to 7592 states and 36219 transitions. [2022-03-15 19:34:22,827 INFO L78 Accepts]: Start accepts. Automaton has 7592 states and 36219 transitions. Word has length 30 [2022-03-15 19:34:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:22,827 INFO L470 AbstractCegarLoop]: Abstraction has 7592 states and 36219 transitions. [2022-03-15 19:34:22,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.212121212121212) internal successors, (238), 33 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 7592 states and 36219 transitions. [2022-03-15 19:34:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:34:22,844 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:22,845 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:22,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:23,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:34:23,059 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash 279090947, now seen corresponding path program 9 times [2022-03-15 19:34:23,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:23,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496643148] [2022-03-15 19:34:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:34:23,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:23,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496643148] [2022-03-15 19:34:23,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496643148] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:23,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136953773] [2022-03-15 19:34:23,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:34:23,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:23,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:23,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:23,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:34:23,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:34:23,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:23,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:34:23,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:34:23,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:34:23,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136953773] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:23,350 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:23,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-03-15 19:34:23,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [570106209] [2022-03-15 19:34:23,350 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:23,353 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:23,428 INFO L252 McrAutomatonBuilder]: Finished intersection with 402 states and 1118 transitions. [2022-03-15 19:34:23,428 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:28,007 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [153226#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)), 153217#(<= (mod ~N~0 4294967296) 0), 153148#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 153222#(and (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), 153219#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 153224#(and (or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), 153221#(and (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)) (or (not (<= (+ (div thread3Thread1of1ForFork1_~i~2 4294967296) 1) 0)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)))), 153225#(or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 153227#(or (<= (mod ~N~0 4294967296) 1) (< 2 (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)), 153228#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 153218#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 153220#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 153223#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))] [2022-03-15 19:34:28,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:34:28,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:28,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:34:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:34:28,008 INFO L87 Difference]: Start difference. First operand 7592 states and 36219 transitions. Second operand has 19 states, 19 states have (on average 8.947368421052632) internal successors, (170), 19 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:29,834 INFO L93 Difference]: Finished difference Result 14384 states and 64160 transitions. [2022-03-15 19:34:29,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:34:29,834 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.947368421052632) internal successors, (170), 19 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:34:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:29,876 INFO L225 Difference]: With dead ends: 14384 [2022-03-15 19:34:29,877 INFO L226 Difference]: Without dead ends: 14282 [2022-03-15 19:34:29,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 381 SyntacticMatches, 50 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=316, Invalid=1324, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:34:29,877 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 292 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:29,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 332 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:34:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14282 states. [2022-03-15 19:34:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14282 to 9386. [2022-03-15 19:34:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9386 states, 9385 states have (on average 4.810122535961641) internal successors, (45143), 9385 states have internal predecessors, (45143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9386 states to 9386 states and 45143 transitions. [2022-03-15 19:34:30,113 INFO L78 Accepts]: Start accepts. Automaton has 9386 states and 45143 transitions. Word has length 31 [2022-03-15 19:34:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:30,114 INFO L470 AbstractCegarLoop]: Abstraction has 9386 states and 45143 transitions. [2022-03-15 19:34:30,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.947368421052632) internal successors, (170), 19 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 9386 states and 45143 transitions. [2022-03-15 19:34:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:34:30,135 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:30,135 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:30,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:30,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:34:30,335 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1205645237, now seen corresponding path program 10 times [2022-03-15 19:34:30,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:30,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45537907] [2022-03-15 19:34:30,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:34:30,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:30,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45537907] [2022-03-15 19:34:30,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45537907] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:30,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087275184] [2022-03-15 19:34:30,420 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:34:30,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:30,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:30,421 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:30,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:34:30,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:34:30,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:30,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:34:30,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:34:30,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:34:30,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087275184] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:30,689 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:30,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-03-15 19:34:30,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [201639025] [2022-03-15 19:34:30,689 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:30,692 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:30,791 INFO L252 McrAutomatonBuilder]: Finished intersection with 350 states and 958 transitions. [2022-03-15 19:34:30,791 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:34,249 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [186638#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 186636#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 186640#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 186635#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 186632#(<= (mod ~N~0 4294967296) 0), 186631#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 186634#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 186633#(and (or (<= (mod ~N~0 4294967296) 0) (<= (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)) (or (<= (mod ~N~0 4294967296) 0) (not (<= (+ (div thread3Thread1of1ForFork1_~i~2 4294967296) 1) 0)))), 186639#(or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)), 186637#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)))] [2022-03-15 19:34:34,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:34:34,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:34,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:34:34,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:34:34,250 INFO L87 Difference]: Start difference. First operand 9386 states and 45143 transitions. Second operand has 16 states, 16 states have (on average 9.0) internal successors, (144), 16 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:35,179 INFO L93 Difference]: Finished difference Result 18002 states and 81095 transitions. [2022-03-15 19:34:35,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:34:35,180 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.0) internal successors, (144), 16 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:34:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:35,233 INFO L225 Difference]: With dead ends: 18002 [2022-03-15 19:34:35,233 INFO L226 Difference]: Without dead ends: 17946 [2022-03-15 19:34:35,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 318 SyntacticMatches, 56 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:34:35,234 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 210 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:35,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 186 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:34:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17946 states. [2022-03-15 19:34:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17946 to 10716. [2022-03-15 19:34:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10716 states, 10715 states have (on average 4.879421371908539) internal successors, (52283), 10715 states have internal predecessors, (52283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10716 states to 10716 states and 52283 transitions. [2022-03-15 19:34:35,549 INFO L78 Accepts]: Start accepts. Automaton has 10716 states and 52283 transitions. Word has length 31 [2022-03-15 19:34:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:35,549 INFO L470 AbstractCegarLoop]: Abstraction has 10716 states and 52283 transitions. [2022-03-15 19:34:35,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0) internal successors, (144), 16 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 10716 states and 52283 transitions. [2022-03-15 19:34:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:34:35,621 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:35,621 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:35,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:35,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:34:35,823 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:35,823 INFO L85 PathProgramCache]: Analyzing trace with hash 817589487, now seen corresponding path program 11 times [2022-03-15 19:34:35,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:35,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335297271] [2022-03-15 19:34:35,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:35,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:35,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:35,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335297271] [2022-03-15 19:34:35,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335297271] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:35,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616817] [2022-03-15 19:34:35,915 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:34:35,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:35,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:35,916 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:35,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:34:35,992 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:34:35,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:35,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:34:35,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:36,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:36,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616817] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:36,154 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:36,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-03-15 19:34:36,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1956197994] [2022-03-15 19:34:36,154 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:36,157 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:36,231 INFO L252 McrAutomatonBuilder]: Finished intersection with 342 states and 934 transitions. [2022-03-15 19:34:36,231 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:38,966 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [226313#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 226314#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 226316#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0 1) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 226311#(<= (mod ~N~0 4294967296) 0), 226317#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 226318#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 226315#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 226312#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 226319#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))] [2022-03-15 19:34:38,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:34:38,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:38,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:34:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:34:38,967 INFO L87 Difference]: Start difference. First operand 10716 states and 52283 transitions. Second operand has 17 states, 17 states have (on average 8.823529411764707) internal successors, (150), 17 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:39,799 INFO L93 Difference]: Finished difference Result 15410 states and 70792 transitions. [2022-03-15 19:34:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:34:39,800 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.823529411764707) internal successors, (150), 17 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:34:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:39,880 INFO L225 Difference]: With dead ends: 15410 [2022-03-15 19:34:39,881 INFO L226 Difference]: Without dead ends: 15336 [2022-03-15 19:34:39,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 355 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:34:39,881 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 198 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:39,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 199 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:34:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15336 states. [2022-03-15 19:34:40,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15336 to 10688. [2022-03-15 19:34:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10688 states, 10687 states have (on average 4.874614017030036) internal successors, (52095), 10687 states have internal predecessors, (52095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10688 states to 10688 states and 52095 transitions. [2022-03-15 19:34:40,209 INFO L78 Accepts]: Start accepts. Automaton has 10688 states and 52095 transitions. Word has length 31 [2022-03-15 19:34:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:40,209 INFO L470 AbstractCegarLoop]: Abstraction has 10688 states and 52095 transitions. [2022-03-15 19:34:40,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.823529411764707) internal successors, (150), 17 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 10688 states and 52095 transitions. [2022-03-15 19:34:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:34:40,232 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:40,232 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:40,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:40,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:34:40,439 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash -540249889, now seen corresponding path program 12 times [2022-03-15 19:34:40,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:40,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072350231] [2022-03-15 19:34:40,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:40,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:40,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:40,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072350231] [2022-03-15 19:34:40,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072350231] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:40,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117266962] [2022-03-15 19:34:40,522 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:34:40,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:40,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:40,523 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:40,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:34:40,624 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:34:40,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:40,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:34:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:40,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:34:40,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117266962] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:40,807 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:40,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-03-15 19:34:40,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [51241754] [2022-03-15 19:34:40,808 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:40,811 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:40,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 416 states and 1148 transitions. [2022-03-15 19:34:40,887 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:44,047 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [263338#(or (<= (mod ~N~0 4294967296) 0) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 263344#(<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0), 263340#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 263341#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 263337#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 263343#(or (<= (mod ~N~0 4294967296) 0) (< 1 (mod ~N~0 4294967296))), 263345#(and (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (<= 2 thread1Thread1of1ForFork2_~i~0)), 263342#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 263346#(and (<= thread1Thread1of1ForFork2_~i~0 1) (<= 1 thread1Thread1of1ForFork2_~i~0)), 263339#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 263336#(<= (mod ~N~0 4294967296) 0)] [2022-03-15 19:34:44,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:34:44,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:34:44,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:34:44,049 INFO L87 Difference]: Start difference. First operand 10688 states and 52095 transitions. Second operand has 19 states, 19 states have (on average 11.157894736842104) internal successors, (212), 19 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:45,310 INFO L93 Difference]: Finished difference Result 18720 states and 87909 transitions. [2022-03-15 19:34:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:34:45,310 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.157894736842104) internal successors, (212), 19 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:34:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:45,370 INFO L225 Difference]: With dead ends: 18720 [2022-03-15 19:34:45,370 INFO L226 Difference]: Without dead ends: 18680 [2022-03-15 19:34:45,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=1717, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:34:45,371 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 193 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 2117 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:45,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 349 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2117 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:34:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18680 states. [2022-03-15 19:34:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18680 to 10272. [2022-03-15 19:34:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10272 states, 10271 states have (on average 4.831954045370461) internal successors, (49629), 10271 states have internal predecessors, (49629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10272 states to 10272 states and 49629 transitions. [2022-03-15 19:34:45,700 INFO L78 Accepts]: Start accepts. Automaton has 10272 states and 49629 transitions. Word has length 31 [2022-03-15 19:34:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:45,701 INFO L470 AbstractCegarLoop]: Abstraction has 10272 states and 49629 transitions. [2022-03-15 19:34:45,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.157894736842104) internal successors, (212), 19 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 10272 states and 49629 transitions. [2022-03-15 19:34:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:34:45,722 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:45,722 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:45,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-15 19:34:45,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:45,923 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1203280557, now seen corresponding path program 13 times [2022-03-15 19:34:45,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:45,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493918443] [2022-03-15 19:34:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:45,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:34:46,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:46,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493918443] [2022-03-15 19:34:46,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493918443] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:46,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308508059] [2022-03-15 19:34:46,014 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:34:46,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:46,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:46,024 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:46,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:34:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:46,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:34:46,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:34:46,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:34:46,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308508059] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:46,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:46,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 19:34:46,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2024866542] [2022-03-15 19:34:46,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:46,314 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:46,377 INFO L252 McrAutomatonBuilder]: Finished intersection with 368 states and 1028 transitions. [2022-03-15 19:34:46,377 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:50,417 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [302868#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 302866#(and (or (<= (mod ~N~0 4294967296) 0) (<= (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)) (or (<= (mod ~N~0 4294967296) 0) (not (<= (+ (div thread3Thread1of1ForFork1_~i~2 4294967296) 1) 0)))), 302864#(and (< 0 (+ (div thread3Thread1of1ForFork1_~i~2 4294967296) 1)) (<= 0 (div (+ (* (- 1) thread3Thread1of1ForFork1_~i~2) 1) 4294967296))), 302865#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 302858#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 302860#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 302862#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))), 302869#(= thread3Thread1of1ForFork1_~i~2 0), 302859#(<= (mod ~N~0 4294967296) 0), 302863#(or (<= (mod ~N~0 4294967296) 1) (< 2 (mod ~N~0 4294967296))), 302867#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 302861#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))] [2022-03-15 19:34:50,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:34:50,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:34:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:34:50,418 INFO L87 Difference]: Start difference. First operand 10272 states and 49629 transitions. Second operand has 19 states, 19 states have (on average 8.578947368421053) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:52,170 INFO L93 Difference]: Finished difference Result 17434 states and 78033 transitions. [2022-03-15 19:34:52,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:34:52,170 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.578947368421053) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:34:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:52,224 INFO L225 Difference]: With dead ends: 17434 [2022-03-15 19:34:52,225 INFO L226 Difference]: Without dead ends: 17434 [2022-03-15 19:34:52,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 332 SyntacticMatches, 66 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:34:52,227 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 273 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:52,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 232 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:34:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17434 states. [2022-03-15 19:34:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17434 to 10600. [2022-03-15 19:34:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10600 states, 10599 states have (on average 4.79592414378715) internal successors, (50832), 10599 states have internal predecessors, (50832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10600 states to 10600 states and 50832 transitions. [2022-03-15 19:34:52,523 INFO L78 Accepts]: Start accepts. Automaton has 10600 states and 50832 transitions. Word has length 31 [2022-03-15 19:34:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:52,524 INFO L470 AbstractCegarLoop]: Abstraction has 10600 states and 50832 transitions. [2022-03-15 19:34:52,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.578947368421053) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 10600 states and 50832 transitions. [2022-03-15 19:34:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:34:52,545 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:52,545 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:52,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:52,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:34:52,746 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:52,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1924508614, now seen corresponding path program 14 times [2022-03-15 19:34:52,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:52,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697655272] [2022-03-15 19:34:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:34:52,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:52,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697655272] [2022-03-15 19:34:52,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697655272] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:52,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686251840] [2022-03-15 19:34:52,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:34:52,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:52,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:52,883 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:52,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:34:52,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:34:52,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:52,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:34:52,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:53,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:53,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686251840] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:53,164 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:53,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-03-15 19:34:53,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1709197625] [2022-03-15 19:34:53,164 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:53,167 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:53,227 INFO L252 McrAutomatonBuilder]: Finished intersection with 352 states and 968 transitions. [2022-03-15 19:34:53,227 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:55,742 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [341766#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 341765#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 341769#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 341768#(<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)), 341770#(<= (+ (* (div thread3Thread1of1ForFork1_~i~2 4294967296) 4294967296) 1) thread3Thread1of1ForFork1_~i~2), 341767#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 341764#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 341763#(<= (mod ~N~0 4294967296) 0)] [2022-03-15 19:34:55,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:34:55,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:55,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:34:55,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:34:55,743 INFO L87 Difference]: Start difference. First operand 10600 states and 50832 transitions. Second operand has 14 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:56,371 INFO L93 Difference]: Finished difference Result 14314 states and 64993 transitions. [2022-03-15 19:34:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:34:56,371 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:34:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:56,414 INFO L225 Difference]: With dead ends: 14314 [2022-03-15 19:34:56,414 INFO L226 Difference]: Without dead ends: 14198 [2022-03-15 19:34:56,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 336 SyntacticMatches, 37 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:34:56,415 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 136 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:56,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 172 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:34:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14198 states. [2022-03-15 19:34:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14198 to 9954. [2022-03-15 19:34:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9954 states, 9953 states have (on average 4.760574701095147) internal successors, (47382), 9953 states have internal predecessors, (47382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9954 states to 9954 states and 47382 transitions. [2022-03-15 19:34:56,736 INFO L78 Accepts]: Start accepts. Automaton has 9954 states and 47382 transitions. Word has length 31 [2022-03-15 19:34:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:56,737 INFO L470 AbstractCegarLoop]: Abstraction has 9954 states and 47382 transitions. [2022-03-15 19:34:56,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 9954 states and 47382 transitions. [2022-03-15 19:34:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:34:56,759 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:56,759 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:56,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:56,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:56,972 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:34:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2086513844, now seen corresponding path program 15 times [2022-03-15 19:34:56,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:56,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83131703] [2022-03-15 19:34:56,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:34:57,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:57,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83131703] [2022-03-15 19:34:57,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83131703] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:57,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069080222] [2022-03-15 19:34:57,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:34:57,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:57,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:57,062 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:57,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:34:57,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:34:57,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:57,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:34:57,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:34:57,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:34:57,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069080222] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:57,324 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:57,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-03-15 19:34:57,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [463692052] [2022-03-15 19:34:57,324 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:57,328 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:57,406 INFO L252 McrAutomatonBuilder]: Finished intersection with 368 states and 1028 transitions. [2022-03-15 19:34:57,406 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:00,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [376221#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 376220#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 376218#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 376219#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 376222#(or (<= (mod ~N~0 4294967296) 0) (< 1 (mod ~N~0 4294967296))), 376216#(<= (mod ~N~0 4294967296) 0), 376224#(<= (+ (* (div thread3Thread1of1ForFork1_~i~2 4294967296) 4294967296) 1) thread3Thread1of1ForFork1_~i~2), 376223#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), 376225#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 376217#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))] [2022-03-15 19:35:00,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:35:00,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:00,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:35:00,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:35:00,247 INFO L87 Difference]: Start difference. First operand 9954 states and 47382 transitions. Second operand has 16 states, 16 states have (on average 8.75) internal successors, (140), 16 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:00,932 INFO L93 Difference]: Finished difference Result 13404 states and 60778 transitions. [2022-03-15 19:35:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:35:00,933 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.75) internal successors, (140), 16 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:35:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:00,972 INFO L225 Difference]: With dead ends: 13404 [2022-03-15 19:35:00,972 INFO L226 Difference]: Without dead ends: 13404 [2022-03-15 19:35:00,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 361 SyntacticMatches, 26 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:35:00,973 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 150 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:00,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 218 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:35:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13404 states. [2022-03-15 19:35:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13404 to 9644. [2022-03-15 19:35:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9644 states, 9643 states have (on average 4.732344706004356) internal successors, (45634), 9643 states have internal predecessors, (45634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9644 states to 9644 states and 45634 transitions. [2022-03-15 19:35:01,214 INFO L78 Accepts]: Start accepts. Automaton has 9644 states and 45634 transitions. Word has length 31 [2022-03-15 19:35:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:01,214 INFO L470 AbstractCegarLoop]: Abstraction has 9644 states and 45634 transitions. [2022-03-15 19:35:01,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.75) internal successors, (140), 16 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 9644 states and 45634 transitions. [2022-03-15 19:35:01,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:35:01,235 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:01,235 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:01,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:01,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:01,452 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1116456993, now seen corresponding path program 16 times [2022-03-15 19:35:01,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:01,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817119158] [2022-03-15 19:35:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:35:01,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:01,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817119158] [2022-03-15 19:35:01,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817119158] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:01,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215365511] [2022-03-15 19:35:01,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:35:01,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:01,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:01,519 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:01,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:35:01,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:35:01,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:01,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:35:01,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:35:01,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:35:01,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215365511] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:01,760 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:01,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-03-15 19:35:01,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [585888535] [2022-03-15 19:35:01,760 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:01,764 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:01,869 INFO L252 McrAutomatonBuilder]: Finished intersection with 458 states and 1274 transitions. [2022-03-15 19:35:01,869 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:08,501 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [409153#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))), 409065#(< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296)), 409155#(or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) 1) (< 2 (mod ~N~0 4294967296))), 409150#(and (or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (<= (mod ~N~0 4294967296) 0) (= |thread4Thread1of1ForFork3_~i~3#1| 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)))), 409151#(or (<= (mod ~N~0 4294967296) 0) (< 1 (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 409152#(and (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 409149#(and (or (<= (mod ~N~0 4294967296) 0) (= |thread4Thread1of1ForFork3_~i~3#1| 0)) (or (<= (mod ~N~0 4294967296) 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), 409147#(and (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)))), 409154#(or (< 1 (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 409143#(or (<= (mod ~N~0 4294967296) (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296)) (< (mod (+ |thread4Thread1of1ForFork3_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))), 409146#(and (or (not (<= (+ (div |thread4Thread1of1ForFork3_~i~3#1| 4294967296) 1) 0)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))) (or (<= (+ |thread4Thread1of1ForFork3_~i~3#1| (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)))), 409148#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 409144#(or (<= (mod ~N~0 4294967296) 0) (< 1 (mod ~N~0 4294967296))), 409145#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))] [2022-03-15 19:35:08,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:35:08,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:08,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:35:08,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:35:08,503 INFO L87 Difference]: Start difference. First operand 9644 states and 45634 transitions. Second operand has 20 states, 20 states have (on average 8.55) internal successors, (171), 20 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:10,880 INFO L93 Difference]: Finished difference Result 19186 states and 88876 transitions. [2022-03-15 19:35:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:35:10,880 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.55) internal successors, (171), 20 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:35:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:10,939 INFO L225 Difference]: With dead ends: 19186 [2022-03-15 19:35:10,940 INFO L226 Difference]: Without dead ends: 19082 [2022-03-15 19:35:10,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 449 SyntacticMatches, 50 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=516, Invalid=2346, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:35:10,941 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 278 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:10,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 317 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:35:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19082 states. [2022-03-15 19:35:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19082 to 13100. [2022-03-15 19:35:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13100 states, 13099 states have (on average 4.857622719291549) internal successors, (63630), 13099 states have internal predecessors, (63630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13100 states to 13100 states and 63630 transitions. [2022-03-15 19:35:11,313 INFO L78 Accepts]: Start accepts. Automaton has 13100 states and 63630 transitions. Word has length 32 [2022-03-15 19:35:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:11,314 INFO L470 AbstractCegarLoop]: Abstraction has 13100 states and 63630 transitions. [2022-03-15 19:35:11,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.55) internal successors, (171), 20 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 13100 states and 63630 transitions. [2022-03-15 19:35:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:35:11,343 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:11,343 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:11,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:11,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:11,544 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash 691703041, now seen corresponding path program 17 times [2022-03-15 19:35:11,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:11,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229712122] [2022-03-15 19:35:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:11,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:11,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229712122] [2022-03-15 19:35:11,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229712122] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:11,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988012019] [2022-03-15 19:35:11,614 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:35:11,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:11,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:11,615 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:11,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:35:11,721 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:11,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:11,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:35:11,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:11,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:11,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988012019] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:11,892 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:11,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-03-15 19:35:11,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135653727] [2022-03-15 19:35:11,892 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:11,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:11,939 INFO L252 McrAutomatonBuilder]: Finished intersection with 226 states and 560 transitions. [2022-03-15 19:35:11,939 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:13,306 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [454840#(or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 454839#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 454835#(or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 454833#(and (or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))) (or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), 454834#(or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))), 454838#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), 454830#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 454841#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 454837#(or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 454836#(or (<= (mod ~N~0 4294967296) 0) (= |thread4Thread1of1ForFork3_~i~3#1| 0)), 454831#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 454766#(< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296)), 454832#(and (or (not (<= (+ (div |thread4Thread1of1ForFork3_~i~3#1| 4294967296) 1) 0)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))) (or (<= (+ |thread4Thread1of1ForFork3_~i~3#1| (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))))] [2022-03-15 19:35:13,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:35:13,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:13,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:35:13,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:35:13,307 INFO L87 Difference]: Start difference. First operand 13100 states and 63630 transitions. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:15,421 INFO L93 Difference]: Finished difference Result 23474 states and 105322 transitions. [2022-03-15 19:35:15,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 19:35:15,421 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:35:15,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:15,500 INFO L225 Difference]: With dead ends: 23474 [2022-03-15 19:35:15,500 INFO L226 Difference]: Without dead ends: 23426 [2022-03-15 19:35:15,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 274 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=708, Invalid=3714, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:35:15,501 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 343 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:15,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 391 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2794 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:35:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23426 states. [2022-03-15 19:35:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23426 to 12744. [2022-03-15 19:35:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12744 states, 12743 states have (on average 4.829239582515891) internal successors, (61539), 12743 states have internal predecessors, (61539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12744 states to 12744 states and 61539 transitions. [2022-03-15 19:35:15,960 INFO L78 Accepts]: Start accepts. Automaton has 12744 states and 61539 transitions. Word has length 32 [2022-03-15 19:35:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:15,960 INFO L470 AbstractCegarLoop]: Abstraction has 12744 states and 61539 transitions. [2022-03-15 19:35:15,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 12744 states and 61539 transitions. [2022-03-15 19:35:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:35:15,990 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:15,990 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:16,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:16,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:16,191 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2146778699, now seen corresponding path program 18 times [2022-03-15 19:35:16,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:16,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655326138] [2022-03-15 19:35:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:16,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:16,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655326138] [2022-03-15 19:35:16,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655326138] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:16,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203020548] [2022-03-15 19:35:16,268 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:35:16,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:16,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:16,269 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:16,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:35:16,464 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:35:16,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:16,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:35:16,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:16,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:16,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203020548] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:16,614 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:16,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-03-15 19:35:16,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1572140736] [2022-03-15 19:35:16,614 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:16,617 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:16,659 INFO L252 McrAutomatonBuilder]: Finished intersection with 218 states and 540 transitions. [2022-03-15 19:35:16,659 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:18,197 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [504134#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), 504130#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 504125#(and (or (<= (mod ~N~0 4294967296) 0) (= |thread4Thread1of1ForFork3_~i~3#1| 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 504128#(or (<= (mod ~N~0 4294967296) 0) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 504129#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 504132#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 504135#(<= (+ (* (div thread3Thread1of1ForFork1_~i~2 4294967296) 4294967296) 1) thread3Thread1of1ForFork1_~i~2), 504133#(and (or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread4Thread1of1ForFork3_~i~3#1| (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)) (or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (not (<= (+ (div |thread4Thread1of1ForFork3_~i~3#1| 4294967296) 1) 0)))), 504140#(or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)), 504137#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 504127#(<= (mod ~N~0 4294967296) 0), 504139#(or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 504131#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 504138#(and (or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 504136#(= thread3Thread1of1ForFork1_~i~2 0), 504066#(< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296)), 504126#(or (<= (mod ~N~0 4294967296) 0) (= |thread4Thread1of1ForFork3_~i~3#1| 0))] [2022-03-15 19:35:18,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:35:18,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:18,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:35:18,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:35:18,199 INFO L87 Difference]: Start difference. First operand 12744 states and 61539 transitions. Second operand has 25 states, 25 states have (on average 6.04) internal successors, (151), 25 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:19,852 INFO L93 Difference]: Finished difference Result 23054 states and 101629 transitions. [2022-03-15 19:35:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:35:19,852 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.04) internal successors, (151), 25 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:35:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:19,929 INFO L225 Difference]: With dead ends: 23054 [2022-03-15 19:35:19,929 INFO L226 Difference]: Without dead ends: 23032 [2022-03-15 19:35:19,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=574, Invalid=2848, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:35:19,930 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 371 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:19,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 325 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:35:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23032 states. [2022-03-15 19:35:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23032 to 12718. [2022-03-15 19:35:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12718 states, 12717 states have (on average 4.8145002752221435) internal successors, (61226), 12717 states have internal predecessors, (61226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12718 states to 12718 states and 61226 transitions. [2022-03-15 19:35:20,324 INFO L78 Accepts]: Start accepts. Automaton has 12718 states and 61226 transitions. Word has length 32 [2022-03-15 19:35:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:20,324 INFO L470 AbstractCegarLoop]: Abstraction has 12718 states and 61226 transitions. [2022-03-15 19:35:20,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.04) internal successors, (151), 25 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:20,324 INFO L276 IsEmpty]: Start isEmpty. Operand 12718 states and 61226 transitions. [2022-03-15 19:35:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:35:20,353 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:20,353 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:20,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:20,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 19:35:20,553 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:20,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:20,554 INFO L85 PathProgramCache]: Analyzing trace with hash -662952841, now seen corresponding path program 19 times [2022-03-15 19:35:20,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:20,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054925058] [2022-03-15 19:35:20,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:20,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:20,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:20,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054925058] [2022-03-15 19:35:20,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054925058] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:20,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705915422] [2022-03-15 19:35:20,609 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:35:20,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:20,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:20,610 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:20,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:35:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:20,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:35:20,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:20,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:20,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705915422] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:20,844 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:20,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-03-15 19:35:20,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930559877] [2022-03-15 19:35:20,844 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:20,847 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:20,886 INFO L252 McrAutomatonBuilder]: Finished intersection with 218 states and 542 transitions. [2022-03-15 19:35:20,886 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:22,272 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [552920#(and (or (<= (mod ~N~0 4294967296) 0) (= |thread4Thread1of1ForFork3_~i~3#1| 0)) (or (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) 0))), 552923#(or (<= (mod ~N~0 4294967296) 0) (= |thread4Thread1of1ForFork3_~i~3#1| 0)), 552922#(or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 552916#(<= (mod ~N~0 4294967296) 0), 552918#(or (<= (mod ~N~0 4294967296) 0) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 552921#(or (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) 0)), 552917#(< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296)), 552919#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 552915#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))] [2022-03-15 19:35:22,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:35:22,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:22,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:35:22,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:35:22,273 INFO L87 Difference]: Start difference. First operand 12718 states and 61226 transitions. Second operand has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:22,885 INFO L93 Difference]: Finished difference Result 19716 states and 92296 transitions. [2022-03-15 19:35:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:35:22,885 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:35:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:22,947 INFO L225 Difference]: With dead ends: 19716 [2022-03-15 19:35:22,947 INFO L226 Difference]: Without dead ends: 19106 [2022-03-15 19:35:22,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 239 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:35:22,948 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 200 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:22,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 132 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19106 states. [2022-03-15 19:35:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19106 to 12144. [2022-03-15 19:35:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12144 states, 12143 states have (on average 4.796425924400889) internal successors, (58243), 12143 states have internal predecessors, (58243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12144 states to 12144 states and 58243 transitions. [2022-03-15 19:35:23,330 INFO L78 Accepts]: Start accepts. Automaton has 12144 states and 58243 transitions. Word has length 32 [2022-03-15 19:35:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:23,330 INFO L470 AbstractCegarLoop]: Abstraction has 12144 states and 58243 transitions. [2022-03-15 19:35:23,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 12144 states and 58243 transitions. [2022-03-15 19:35:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:35:23,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:23,355 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:23,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:23,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 19:35:23,560 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:23,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1602392098, now seen corresponding path program 20 times [2022-03-15 19:35:23,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:23,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634282936] [2022-03-15 19:35:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:23,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:23,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634282936] [2022-03-15 19:35:23,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634282936] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:23,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358779783] [2022-03-15 19:35:23,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:35:23,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:23,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:23,633 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:23,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:35:23,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:23,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:23,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:35:23,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:23,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:23,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358779783] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:23,904 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:23,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-03-15 19:35:23,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119060445] [2022-03-15 19:35:23,905 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:23,908 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:23,963 INFO L252 McrAutomatonBuilder]: Finished intersection with 290 states and 742 transitions. [2022-03-15 19:35:23,963 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:25,867 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [597167#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 597165#(and (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (<= 2 thread1Thread1of1ForFork2_~i~0)), 597163#(or (<= (mod ~N~0 4294967296) 0) (<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 597162#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ 3 thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296)) (+ (* (div (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) 4294967296) ~N~0))), 597164#(<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0), 597168#(and (<= thread1Thread1of1ForFork2_~i~0 1) (<= 1 thread1Thread1of1ForFork2_~i~0)), 597166#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 597169#(= thread3Thread1of1ForFork1_~i~2 0), 597097#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))] [2022-03-15 19:35:25,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:35:25,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:35:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:35:25,868 INFO L87 Difference]: Start difference. First operand 12144 states and 58243 transitions. Second operand has 17 states, 17 states have (on average 9.0) internal successors, (153), 17 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:26,851 INFO L93 Difference]: Finished difference Result 18518 states and 84675 transitions. [2022-03-15 19:35:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:35:26,851 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.0) internal successors, (153), 17 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:35:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:26,996 INFO L225 Difference]: With dead ends: 18518 [2022-03-15 19:35:26,996 INFO L226 Difference]: Without dead ends: 18518 [2022-03-15 19:35:26,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 319 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:35:26,997 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 168 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:26,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 313 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:35:27,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18518 states. [2022-03-15 19:35:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18518 to 10678. [2022-03-15 19:35:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10678 states, 10677 states have (on average 4.636414723236864) internal successors, (49503), 10677 states have internal predecessors, (49503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10678 states to 10678 states and 49503 transitions. [2022-03-15 19:35:27,253 INFO L78 Accepts]: Start accepts. Automaton has 10678 states and 49503 transitions. Word has length 32 [2022-03-15 19:35:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:27,253 INFO L470 AbstractCegarLoop]: Abstraction has 10678 states and 49503 transitions. [2022-03-15 19:35:27,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.0) internal successors, (153), 17 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 10678 states and 49503 transitions. [2022-03-15 19:35:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:35:27,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:27,274 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:27,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:27,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:27,484 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -233665386, now seen corresponding path program 21 times [2022-03-15 19:35:27,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:27,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046503429] [2022-03-15 19:35:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:27,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:27,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046503429] [2022-03-15 19:35:27,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046503429] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:27,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870056193] [2022-03-15 19:35:27,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:35:27,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:27,545 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:27,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:35:27,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:35:27,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:27,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:35:27,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:35:27,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:35:27,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870056193] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:27,859 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:27,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-03-15 19:35:27,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [710807427] [2022-03-15 19:35:27,859 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:27,873 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:27,925 INFO L252 McrAutomatonBuilder]: Finished intersection with 276 states and 724 transitions. [2022-03-15 19:35:27,925 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:29,867 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [637293#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 637294#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 637298#(= thread3Thread1of1ForFork1_~i~2 0), 637292#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 637291#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (or (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~i~0 0))), 637296#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div (+ 4294967294 thread1Thread1of1ForFork2_~i~0) 4294967296)) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 637290#(<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)), 637297#(and (< 0 (+ (div thread3Thread1of1ForFork1_~i~2 4294967296) 1)) (<= thread3Thread1of1ForFork1_~i~2 1)), 637295#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0 1) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))] [2022-03-15 19:35:29,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:35:29,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:29,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:35:29,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:35:29,868 INFO L87 Difference]: Start difference. First operand 10678 states and 49503 transitions. Second operand has 17 states, 17 states have (on average 8.117647058823529) internal successors, (138), 17 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:30,576 INFO L93 Difference]: Finished difference Result 16410 states and 74511 transitions. [2022-03-15 19:35:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:35:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.117647058823529) internal successors, (138), 17 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:35:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:30,623 INFO L225 Difference]: With dead ends: 16410 [2022-03-15 19:35:30,623 INFO L226 Difference]: Without dead ends: 16200 [2022-03-15 19:35:30,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 276 SyntacticMatches, 21 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:35:30,627 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 139 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:30,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 211 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:35:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16200 states. [2022-03-15 19:35:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16200 to 10146. [2022-03-15 19:35:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10146 states, 10145 states have (on average 4.678560867422376) internal successors, (47464), 10145 states have internal predecessors, (47464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 47464 transitions. [2022-03-15 19:35:30,921 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 47464 transitions. Word has length 32 [2022-03-15 19:35:30,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:30,921 INFO L470 AbstractCegarLoop]: Abstraction has 10146 states and 47464 transitions. [2022-03-15 19:35:30,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.117647058823529) internal successors, (138), 17 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 47464 transitions. [2022-03-15 19:35:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:35:30,941 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:30,941 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:30,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:31,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:31,142 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1290367771, now seen corresponding path program 22 times [2022-03-15 19:35:31,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:31,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904219347] [2022-03-15 19:35:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:35:31,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:31,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904219347] [2022-03-15 19:35:31,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904219347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:31,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400396946] [2022-03-15 19:35:31,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:35:31,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:31,220 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:31,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:35:31,317 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:35:31,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:31,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:35:31,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:35:31,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:35:31,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400396946] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:31,469 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:31,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 19:35:31,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1865855390] [2022-03-15 19:35:31,469 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:31,473 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:31,516 INFO L252 McrAutomatonBuilder]: Finished intersection with 236 states and 600 transitions. [2022-03-15 19:35:31,517 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:33,022 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [674241#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), 674231#(< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296)), 674228#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 674235#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 674232#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 674237#(or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 674242#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 674229#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) (mod ~N~0 4294967296))), 674236#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 674243#(= thread3Thread1of1ForFork1_~i~2 0), 674230#(<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)), 674233#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) (mod ~N~0 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 674240#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 674239#(and (<= 0 (div (+ (* (- 1) |thread4Thread1of1ForFork3_~i~3#1|) 1) 4294967296)) (< 0 (+ (div |thread4Thread1of1ForFork3_~i~3#1| 4294967296) 1))), 674234#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 674238#(<= 0 (div (+ (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296) 1) 4294967296))] [2022-03-15 19:35:33,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:35:33,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:35:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:35:33,023 INFO L87 Difference]: Start difference. First operand 10146 states and 47464 transitions. Second operand has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:35,632 INFO L93 Difference]: Finished difference Result 18038 states and 83225 transitions. [2022-03-15 19:35:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 19:35:35,633 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:35:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:35,688 INFO L225 Difference]: With dead ends: 18038 [2022-03-15 19:35:35,689 INFO L226 Difference]: Without dead ends: 17580 [2022-03-15 19:35:35,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 294 SyntacticMatches, 11 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1079, Invalid=6753, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 19:35:35,690 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 281 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 3490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:35,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 632 Invalid, 3490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:35:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2022-03-15 19:35:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9832. [2022-03-15 19:35:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9832 states, 9831 states have (on average 4.656901637676737) internal successors, (45782), 9831 states have internal predecessors, (45782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9832 states to 9832 states and 45782 transitions. [2022-03-15 19:35:36,019 INFO L78 Accepts]: Start accepts. Automaton has 9832 states and 45782 transitions. Word has length 32 [2022-03-15 19:35:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:36,019 INFO L470 AbstractCegarLoop]: Abstraction has 9832 states and 45782 transitions. [2022-03-15 19:35:36,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 9832 states and 45782 transitions. [2022-03-15 19:35:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:35:36,039 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:36,039 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:36,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 19:35:36,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:35:36,240 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:36,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1942208791, now seen corresponding path program 23 times [2022-03-15 19:35:36,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:36,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756115212] [2022-03-15 19:35:36,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:36,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:36,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:36,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756115212] [2022-03-15 19:35:36,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756115212] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:36,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787956726] [2022-03-15 19:35:36,329 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:35:36,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:36,330 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:36,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:35:36,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:35:36,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:36,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:35:36,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:36,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:36,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787956726] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:36,620 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:36,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-03-15 19:35:36,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1836707369] [2022-03-15 19:35:36,620 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:36,623 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:36,714 INFO L252 McrAutomatonBuilder]: Finished intersection with 420 states and 1142 transitions. [2022-03-15 19:35:36,714 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:44,059 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [712329#(and (or (<= (mod ~counter~0 4294967296) 0) (<= ~counter~0 (* 2 ~c~0))) (or (<= (mod ~counter~0 4294967296) 0) (<= (* 2 ~c~0) ~counter~0))), 712328#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~c~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (<= (* 2 ~c~0) ~counter~0)) (or (<= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~c~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0))), 712327#(and (or (<= (mod ~counter~0 4294967296) 0) (<= (* 3 ~c~0) ~counter~0)) (or (<= ~counter~0 (* 3 ~c~0)) (<= (mod ~counter~0 4294967296) 0))), 712331#(and (or (<= ~counter~0 0) (<= (mod (+ ~counter~0 (* 2 ~c~0)) 4294967296) 0)) (or (<= 0 ~counter~0) (<= (mod (+ ~counter~0 (* 2 ~c~0)) 4294967296) 0))), 712326#(and (or (<= (mod ~counter~0 4294967296) 0) (<= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (<= (mod ~counter~0 4294967296) 0) (<= ~c~0 ~counter~0))), 712330#(and (or (<= (mod (+ ~counter~0 ~c~0) 4294967296) 0) (<= ~counter~0 ~c~0)) (or (<= (mod (+ ~counter~0 ~c~0) 4294967296) 0) (<= ~c~0 ~counter~0)))] [2022-03-15 19:35:44,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:35:44,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:35:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:35:44,060 INFO L87 Difference]: Start difference. First operand 9832 states and 45782 transitions. Second operand has 13 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:44,488 INFO L93 Difference]: Finished difference Result 18863 states and 86034 transitions. [2022-03-15 19:35:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:35:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:35:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:44,549 INFO L225 Difference]: With dead ends: 18863 [2022-03-15 19:35:44,550 INFO L226 Difference]: Without dead ends: 18536 [2022-03-15 19:35:44,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 421 SyntacticMatches, 23 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:35:44,550 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 164 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:44,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 92 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18536 states. [2022-03-15 19:35:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18536 to 12886. [2022-03-15 19:35:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12886 states, 12885 states have (on average 4.711525029103609) internal successors, (60708), 12885 states have internal predecessors, (60708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 60708 transitions. [2022-03-15 19:35:44,882 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 60708 transitions. Word has length 33 [2022-03-15 19:35:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:44,883 INFO L470 AbstractCegarLoop]: Abstraction has 12886 states and 60708 transitions. [2022-03-15 19:35:44,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 60708 transitions. [2022-03-15 19:35:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:35:44,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:44,912 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:44,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:45,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:35:45,119 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2132185517, now seen corresponding path program 24 times [2022-03-15 19:35:45,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:45,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867773278] [2022-03-15 19:35:45,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:45,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:45,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867773278] [2022-03-15 19:35:45,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867773278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:45,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524950838] [2022-03-15 19:35:45,219 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:35:45,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:45,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:45,220 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:45,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:35:45,360 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:35:45,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:45,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:35:45,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:45,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:45,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524950838] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:45,652 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:45,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-03-15 19:35:45,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000126078] [2022-03-15 19:35:45,652 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:45,655 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:45,744 INFO L252 McrAutomatonBuilder]: Finished intersection with 464 states and 1300 transitions. [2022-03-15 19:35:45,744 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:51,751 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [757177#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~c~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (<= (* ~c~0 4) ~counter~0)) (or (<= ~counter~0 (* ~c~0 4)) (<= (mod (+ ~counter~0 (* 4294967295 ~c~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0))), 757178#(or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (<= (mod ~counter~0 4294967296) 0)), 757176#(and (or (<= (mod ~counter~0 4294967296) 0) (<= (* 3 ~c~0) ~counter~0)) (or (<= ~counter~0 (* 3 ~c~0)) (<= (mod ~counter~0 4294967296) 0))), 757179#(or (<= (mod (+ ~counter~0 (* 4294967295 ~c~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))] [2022-03-15 19:35:51,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:35:51,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:51,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:35:51,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:35:51,752 INFO L87 Difference]: Start difference. First operand 12886 states and 60708 transitions. Second operand has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:52,286 INFO L93 Difference]: Finished difference Result 24033 states and 110722 transitions. [2022-03-15 19:35:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:35:52,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:35:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:52,363 INFO L225 Difference]: With dead ends: 24033 [2022-03-15 19:35:52,363 INFO L226 Difference]: Without dead ends: 23698 [2022-03-15 19:35:52,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 467 SyntacticMatches, 17 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:35:52,364 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 168 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:52,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 116 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:35:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23698 states. [2022-03-15 19:35:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23698 to 16274. [2022-03-15 19:35:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16274 states, 16273 states have (on average 4.740674737294905) internal successors, (77145), 16273 states have internal predecessors, (77145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16274 states to 16274 states and 77145 transitions. [2022-03-15 19:35:52,762 INFO L78 Accepts]: Start accepts. Automaton has 16274 states and 77145 transitions. Word has length 33 [2022-03-15 19:35:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:52,762 INFO L470 AbstractCegarLoop]: Abstraction has 16274 states and 77145 transitions. [2022-03-15 19:35:52,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 16274 states and 77145 transitions. [2022-03-15 19:35:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:35:52,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:52,796 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:52,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:52,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:35:52,997 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash 878745058, now seen corresponding path program 25 times [2022-03-15 19:35:52,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:52,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713990951] [2022-03-15 19:35:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:53,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:53,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713990951] [2022-03-15 19:35:53,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713990951] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:53,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783299662] [2022-03-15 19:35:53,085 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:35:53,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:53,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:53,086 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:53,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:35:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:53,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:35:53,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:53,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:35:53,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783299662] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:53,443 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:53,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2022-03-15 19:35:53,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2117066278] [2022-03-15 19:35:53,443 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:53,446 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:53,497 INFO L252 McrAutomatonBuilder]: Finished intersection with 260 states and 654 transitions. [2022-03-15 19:35:53,498 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:56,351 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [813976#(or (<= (mod ~N~0 4294967296) 0) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 813980#(<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0), 813988#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)))), 813982#(and (or (<= (mod ~N~0 4294967296) 0) (<= 2 thread1Thread1of1ForFork2_~i~0)) (or (<= (mod ~N~0 4294967296) 0) (= |thread4Thread1of1ForFork3_~i~3#1| 0)) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 813977#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 813984#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~i~0)) (or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 813979#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ 2 |thread4Thread1of1ForFork3_~i~3#1| (* (div ~N~0 4294967296) 4294967296)) (+ (* (div |thread4Thread1of1ForFork3_~i~3#1| 4294967296) 4294967296) ~N~0))), 813986#(and (<= thread1Thread1of1ForFork2_~i~0 1) (<= 1 thread1Thread1of1ForFork2_~i~0)), 813974#(< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296)), 813981#(and (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (<= 2 thread1Thread1of1ForFork2_~i~0)), 813983#(and (or (<= (mod ~N~0 4294967296) 0) (<= 2 thread1Thread1of1ForFork2_~i~0)) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 813978#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (< (mod |thread4Thread1of1ForFork3_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 813990#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 813985#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~i~0))), 813989#(or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) 1)), 813987#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)))), 813975#(<= (mod ~N~0 4294967296) 0)] [2022-03-15 19:35:56,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:35:56,352 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:56,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:35:56,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1225, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:35:56,352 INFO L87 Difference]: Start difference. First operand 16274 states and 77145 transitions. Second operand has 25 states, 25 states have (on average 6.88) internal successors, (172), 25 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:57,674 INFO L93 Difference]: Finished difference Result 33762 states and 152904 transitions. [2022-03-15 19:35:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:35:57,675 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.88) internal successors, (172), 25 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:35:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:57,785 INFO L225 Difference]: With dead ends: 33762 [2022-03-15 19:35:57,786 INFO L226 Difference]: Without dead ends: 33460 [2022-03-15 19:35:57,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:35:57,787 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 363 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:57,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 287 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:35:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33460 states. [2022-03-15 19:35:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33460 to 18076. [2022-03-15 19:35:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18076 states, 18075 states have (on average 4.709820193637621) internal successors, (85130), 18075 states have internal predecessors, (85130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18076 states to 18076 states and 85130 transitions. [2022-03-15 19:35:58,304 INFO L78 Accepts]: Start accepts. Automaton has 18076 states and 85130 transitions. Word has length 33 [2022-03-15 19:35:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:58,304 INFO L470 AbstractCegarLoop]: Abstraction has 18076 states and 85130 transitions. [2022-03-15 19:35:58,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.88) internal successors, (172), 25 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 18076 states and 85130 transitions. [2022-03-15 19:35:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:35:58,342 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:58,342 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:58,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:58,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:58,542 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:35:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1947961601, now seen corresponding path program 26 times [2022-03-15 19:35:58,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:58,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645377666] [2022-03-15 19:35:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:35:58,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:58,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645377666] [2022-03-15 19:35:58,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645377666] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:58,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441155701] [2022-03-15 19:35:58,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:35:58,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:58,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:58,630 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:35:58,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:35:58,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:58,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:58,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:35:58,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:35:58,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:35:59,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441155701] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:59,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:59,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-03-15 19:35:59,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986590003] [2022-03-15 19:35:59,009 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:59,012 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:59,122 INFO L252 McrAutomatonBuilder]: Finished intersection with 524 states and 1466 transitions. [2022-03-15 19:35:59,123 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:06,192 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [884183#(and (or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (<= 0 (div (+ 2 (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296))) (or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 884184#(or (< (mod (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (<= 0 (div (+ 2 (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296))), 884172#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 884176#(and (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= 0 (div (+ 2 (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296)))), 884180#(or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 0 (div (+ 2 (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296))), 884185#(or (<= (mod ~N~0 4294967296) 1) (< 2 (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)), 884170#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 884171#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 884177#(and (or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= 0 (div (+ 2 (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296))) (or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 884167#(<= (mod ~N~0 4294967296) 0), 884168#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 884179#(and (or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (< (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 0 (div (+ 2 (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296)))), 884175#(and (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)) (<= 0 (div (+ 2 (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296))), 884173#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= thread3Thread1of1ForFork1_~i~2 (+ (* 4294967296 (div (+ (* (- 1) ~N~0) thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1) 4294967296)) 4294967294))), 884174#(or (< (mod (+ 2 thread3Thread1of1ForFork1_~i~2) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296))), 884169#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) (mod ~N~0 4294967296))), 884181#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ 3 thread3Thread1of1ForFork1_~i~2) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ 2 thread3Thread1of1ForFork1_~i~2) 4294967296))), 884178#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= 0 (div (+ 2 (* (- 1) ~N~0) (* (div ~N~0 4294967296) 4294967296)) 4294967296))), 884166#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 884182#(or (< 3 (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) 2))] [2022-03-15 19:36:06,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:36:06,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:06,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:36:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:36:06,193 INFO L87 Difference]: Start difference. First operand 18076 states and 85130 transitions. Second operand has 29 states, 29 states have (on average 7.517241379310345) internal successors, (218), 29 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:11,239 INFO L93 Difference]: Finished difference Result 43986 states and 202341 transitions. [2022-03-15 19:36:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 19:36:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.517241379310345) internal successors, (218), 29 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:36:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:11,394 INFO L225 Difference]: With dead ends: 43986 [2022-03-15 19:36:11,394 INFO L226 Difference]: Without dead ends: 43242 [2022-03-15 19:36:11,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 534 SyntacticMatches, 35 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=768, Invalid=4488, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:36:11,395 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 540 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 4370 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 4473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:11,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 850 Invalid, 4473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4370 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 19:36:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43242 states. [2022-03-15 19:36:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43242 to 23226. [2022-03-15 19:36:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23226 states, 23225 states have (on average 4.894682454251884) internal successors, (113679), 23225 states have internal predecessors, (113679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23226 states to 23226 states and 113679 transitions. [2022-03-15 19:36:12,131 INFO L78 Accepts]: Start accepts. Automaton has 23226 states and 113679 transitions. Word has length 34 [2022-03-15 19:36:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:12,131 INFO L470 AbstractCegarLoop]: Abstraction has 23226 states and 113679 transitions. [2022-03-15 19:36:12,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.517241379310345) internal successors, (218), 29 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 23226 states and 113679 transitions. [2022-03-15 19:36:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:36:12,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:12,279 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:12,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:12,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:12,487 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:36:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1715115344, now seen corresponding path program 27 times [2022-03-15 19:36:12,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:12,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274107244] [2022-03-15 19:36:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:12,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:36:12,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:12,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274107244] [2022-03-15 19:36:12,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274107244] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:12,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893460442] [2022-03-15 19:36:12,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:36:12,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:12,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:12,594 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:12,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:36:12,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:36:12,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:12,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:36:12,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:36:12,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:36:12,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893460442] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:12,966 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:12,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-03-15 19:36:12,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [433185314] [2022-03-15 19:36:12,966 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:12,969 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:13,029 INFO L252 McrAutomatonBuilder]: Finished intersection with 300 states and 766 transitions. [2022-03-15 19:36:13,029 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:17,685 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [974965#(or (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (+ (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296) 1)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) (mod ~N~0 4294967296))), 974958#(<= (mod ~N~0 4294967296) 0), 974963#(or (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 974967#(or (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (mod ~N~0 4294967296) 1) (< 2 (mod ~N~0 4294967296))), 974960#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 974968#(or (<= (+ (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296) 1)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (< 2 (mod ~N~0 4294967296))), 974969#(or (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= ~N~0 (+ 2 (* (div ~N~0 4294967296) 4294967296))) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) (mod ~N~0 4294967296))), 974966#(or (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) (mod ~N~0 4294967296)) (<= (+ ~N~0 (* (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 4294967296)) (+ 2 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 974964#(or (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) (mod ~N~0 4294967296))), 974973#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~i~0))), 974959#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 974972#(or (<= (mod ~N~0 4294967296) 1) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 974971#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)))), 974974#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)))), 974961#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 974970#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 974962#(or (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)))] [2022-03-15 19:36:17,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:36:17,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:17,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:36:17,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1274, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:36:17,686 INFO L87 Difference]: Start difference. First operand 23226 states and 113679 transitions. Second operand has 26 states, 26 states have (on average 5.961538461538462) internal successors, (155), 26 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:22,276 INFO L93 Difference]: Finished difference Result 53242 states and 250089 transitions. [2022-03-15 19:36:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 19:36:22,276 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.961538461538462) internal successors, (155), 26 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:36:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:22,479 INFO L225 Difference]: With dead ends: 53242 [2022-03-15 19:36:22,479 INFO L226 Difference]: Without dead ends: 52496 [2022-03-15 19:36:22,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1354, Invalid=6478, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 19:36:22,480 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 572 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 2828 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:22,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 502 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2828 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 19:36:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52496 states. [2022-03-15 19:36:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52496 to 29846. [2022-03-15 19:36:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29846 states, 29845 states have (on average 5.037259172390685) internal successors, (150337), 29845 states have internal predecessors, (150337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29846 states to 29846 states and 150337 transitions. [2022-03-15 19:36:23,826 INFO L78 Accepts]: Start accepts. Automaton has 29846 states and 150337 transitions. Word has length 34 [2022-03-15 19:36:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:23,826 INFO L470 AbstractCegarLoop]: Abstraction has 29846 states and 150337 transitions. [2022-03-15 19:36:23,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.961538461538462) internal successors, (155), 26 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 29846 states and 150337 transitions. [2022-03-15 19:36:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:36:24,029 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:24,029 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:24,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:24,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:24,248 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:36:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1009529136, now seen corresponding path program 28 times [2022-03-15 19:36:24,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:24,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467095706] [2022-03-15 19:36:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:36:24,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:24,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467095706] [2022-03-15 19:36:24,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467095706] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:24,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733121467] [2022-03-15 19:36:24,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:36:24,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:24,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:24,392 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:24,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:36:24,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:36:24,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:24,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:36:24,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:36:24,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:36:24,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733121467] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:24,799 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:24,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-03-15 19:36:24,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142626902] [2022-03-15 19:36:24,799 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:24,802 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:24,894 INFO L252 McrAutomatonBuilder]: Finished intersection with 262 states and 658 transitions. [2022-03-15 19:36:24,894 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:28,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1088281#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 1088291#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)))), 1088283#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 1088285#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 1088284#(<= (mod ~N~0 4294967296) 0), 1088282#(or (<= (mod ~N~0 4294967296) 1) (= thread3Thread1of1ForFork1_~i~2 0)), 1088279#(and (or (<= (mod ~N~0 4294967296) 0) (<= 2 thread1Thread1of1ForFork2_~i~0)) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 1088280#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~i~0)) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 1088286#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 1088289#(and (or (<= (mod ~N~0 4294967296) 0) (<= 2 thread1Thread1of1ForFork2_~i~0)) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1088288#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 1088287#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 1088290#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~i~0)))] [2022-03-15 19:36:28,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:36:28,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:28,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:36:28,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:36:28,643 INFO L87 Difference]: Start difference. First operand 29846 states and 150337 transitions. Second operand has 22 states, 22 states have (on average 7.318181818181818) internal successors, (161), 22 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:30,367 INFO L93 Difference]: Finished difference Result 53612 states and 259793 transitions. [2022-03-15 19:36:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:36:30,368 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.318181818181818) internal successors, (161), 22 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:36:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:30,794 INFO L225 Difference]: With dead ends: 53612 [2022-03-15 19:36:30,794 INFO L226 Difference]: Without dead ends: 52822 [2022-03-15 19:36:30,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 286 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=549, Invalid=2757, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:36:30,794 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 280 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:30,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 361 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:36:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2022-03-15 19:36:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 32742. [2022-03-15 19:36:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32742 states, 32741 states have (on average 5.084664487950887) internal successors, (166477), 32741 states have internal predecessors, (166477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32742 states to 32742 states and 166477 transitions. [2022-03-15 19:36:32,017 INFO L78 Accepts]: Start accepts. Automaton has 32742 states and 166477 transitions. Word has length 34 [2022-03-15 19:36:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:32,017 INFO L470 AbstractCegarLoop]: Abstraction has 32742 states and 166477 transitions. [2022-03-15 19:36:32,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.318181818181818) internal successors, (161), 22 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 32742 states and 166477 transitions. [2022-03-15 19:36:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:36:32,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:32,102 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:32,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:32,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-03-15 19:36:32,307 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:36:32,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash 359903616, now seen corresponding path program 29 times [2022-03-15 19:36:32,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:32,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113430362] [2022-03-15 19:36:32,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:32,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:36:32,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:32,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113430362] [2022-03-15 19:36:32,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113430362] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:32,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282808091] [2022-03-15 19:36:32,528 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:36:32,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:32,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:32,529 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:32,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:36:32,709 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:36:32,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:32,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:36:32,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:36:32,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:36:33,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282808091] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:33,026 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:33,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-03-15 19:36:33,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222299659] [2022-03-15 19:36:33,026 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:33,030 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:33,118 INFO L252 McrAutomatonBuilder]: Finished intersection with 256 states and 643 transitions. [2022-03-15 19:36:33,119 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:37,454 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [1207676#(<= (mod ~N~0 4294967296) 0), 1207678#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 1207685#(and (or (<= (mod ~N~0 4294967296) 1) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) 1) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)))), 1207677#(or (<= (mod ~N~0 4294967296) 0) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 1207686#(and (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork2_~i~0)) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 1) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 1207681#(and (or (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)))), 1207680#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 1207682#(and (or (<= (mod ~N~0 4294967296) 0) (<= 2 thread1Thread1of1ForFork2_~i~0)) (or (<= (mod ~N~0 4294967296) 0) (<= thread1Thread1of1ForFork2_~i~0 2))), 1207674#(and (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2) thread1Thread1of1ForFork2_~i~0)) (or (<= thread1Thread1of1ForFork2_~i~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 2)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)))), 1207675#(and (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= thread1Thread1of1ForFork2_~i~0 (+ |thread2Thread1of1ForFork0_~i~1#1| 1)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork2_~i~0))), 1207684#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)))), 1207687#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)))), 1207688#(or (<= (mod ~N~0 4294967296) 1) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1207679#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 1207683#(and (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~i~0)) (or (<= thread1Thread1of1ForFork2_~i~0 1) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))))] [2022-03-15 19:36:37,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:36:37,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:37,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:36:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:36:37,454 INFO L87 Difference]: Start difference. First operand 32742 states and 166477 transitions. Second operand has 24 states, 24 states have (on average 6.791666666666667) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:42,596 INFO L93 Difference]: Finished difference Result 63392 states and 300365 transitions. [2022-03-15 19:36:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 19:36:42,597 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.791666666666667) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:36:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:43,021 INFO L225 Difference]: With dead ends: 63392 [2022-03-15 19:36:43,021 INFO L226 Difference]: Without dead ends: 62980 [2022-03-15 19:36:43,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 302 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=998, Invalid=6312, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 19:36:43,022 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 708 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 4137 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 4247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 4137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:43,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [708 Valid, 724 Invalid, 4247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 4137 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:36:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62980 states. [2022-03-15 19:36:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62980 to 29886. [2022-03-15 19:36:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29886 states, 29885 states have (on average 4.997590764597624) internal successors, (149353), 29885 states have internal predecessors, (149353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29886 states to 29886 states and 149353 transitions. [2022-03-15 19:36:44,422 INFO L78 Accepts]: Start accepts. Automaton has 29886 states and 149353 transitions. Word has length 34 [2022-03-15 19:36:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:44,422 INFO L470 AbstractCegarLoop]: Abstraction has 29886 states and 149353 transitions. [2022-03-15 19:36:44,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.791666666666667) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 29886 states and 149353 transitions. [2022-03-15 19:36:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:36:44,500 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:44,501 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:44,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:44,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:44,701 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:36:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash -297721087, now seen corresponding path program 30 times [2022-03-15 19:36:44,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:44,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041414799] [2022-03-15 19:36:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:44,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:44,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041414799] [2022-03-15 19:36:44,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041414799] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:44,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058172319] [2022-03-15 19:36:44,847 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:36:44,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:44,848 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:44,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:36:44,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:36:44,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:44,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:36:44,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:45,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:45,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058172319] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:45,373 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:45,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2022-03-15 19:36:45,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113611489] [2022-03-15 19:36:45,373 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:45,376 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:45,459 INFO L252 McrAutomatonBuilder]: Finished intersection with 368 states and 976 transitions. [2022-03-15 19:36:45,459 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:52,091 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [1331258#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 1331256#(and (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1331246#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ (* (div (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) 4294967296) ~N~0) (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1))), 1331231#(and (or (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1331250#(and (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 1331232#(and (or (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1331249#(and (or (<= (mod ~N~0 4294967296) 0) (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1331244#(or (< (mod (+ 2 thread3Thread1of1ForFork1_~i~2) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296))), 1331238#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 1331254#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 1331248#(and (or (<= (mod ~N~0 4294967296) 0) (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 1331255#(and (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1331241#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 1331234#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 1331251#(and (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 1331242#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 1331237#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 1331239#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296))), 1331243#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 1331245#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ (* (div (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) 4294967296) ~N~0) (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1))), 1331247#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ (* (div (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) 4294967296) ~N~0) (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 1331252#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 1331235#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 1331257#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1331253#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 1331233#(<= (mod ~N~0 4294967296) 0), 1331240#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 1331236#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) (mod ~N~0 4294967296)))] [2022-03-15 19:36:52,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:36:52,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:52,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:36:52,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2380, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:36:52,093 INFO L87 Difference]: Start difference. First operand 29886 states and 149353 transitions. Second operand has 40 states, 40 states have (on average 6.7) internal successors, (268), 40 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:04,718 INFO L93 Difference]: Finished difference Result 94252 states and 431682 transitions. [2022-03-15 19:37:04,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-03-15 19:37:04,719 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 6.7) internal successors, (268), 40 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:37:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:05,292 INFO L225 Difference]: With dead ends: 94252 [2022-03-15 19:37:05,293 INFO L226 Difference]: Without dead ends: 93082 [2022-03-15 19:37:05,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 463 SyntacticMatches, 19 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9771 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3138, Invalid=26618, Unknown=0, NotChecked=0, Total=29756 [2022-03-15 19:37:05,294 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 699 mSDsluCounter, 5389 mSDsCounter, 0 mSdLazyCounter, 8868 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 9100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 8868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:05,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [699 Valid, 1159 Invalid, 9100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 8868 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-03-15 19:37:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93082 states. [2022-03-15 19:37:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93082 to 37218. [2022-03-15 19:37:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37218 states, 37217 states have (on average 5.103984738157294) internal successors, (189955), 37217 states have internal predecessors, (189955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37218 states to 37218 states and 189955 transitions. [2022-03-15 19:37:07,067 INFO L78 Accepts]: Start accepts. Automaton has 37218 states and 189955 transitions. Word has length 34 [2022-03-15 19:37:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:07,067 INFO L470 AbstractCegarLoop]: Abstraction has 37218 states and 189955 transitions. [2022-03-15 19:37:07,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.7) internal successors, (268), 40 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 37218 states and 189955 transitions. [2022-03-15 19:37:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:37:07,167 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:07,167 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:07,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:07,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:07,368 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:37:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash 117904055, now seen corresponding path program 31 times [2022-03-15 19:37:07,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:07,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683693800] [2022-03-15 19:37:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:07,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:07,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:07,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683693800] [2022-03-15 19:37:07,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683693800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:07,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878144829] [2022-03-15 19:37:07,533 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:37:07,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:07,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:07,534 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:07,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:37:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:07,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:37:07,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:37:07,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:37:08,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878144829] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:08,034 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:08,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-03-15 19:37:08,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1776416711] [2022-03-15 19:37:08,034 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:08,037 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:08,115 INFO L252 McrAutomatonBuilder]: Finished intersection with 348 states and 910 transitions. [2022-03-15 19:37:08,115 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:14,298 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [1500554#(and (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1500541#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 1500550#(and (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 1500540#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 1500552#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 1500542#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 1500546#(and (or (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1500551#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 1500539#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296))), 1500537#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 1500543#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 1500555#(and (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1500534#(<= (mod ~N~0 4294967296) 0), 1500549#(and (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 1500547#(and (or (<= (mod ~N~0 4294967296) 0) (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 1500556#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1500535#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 1500538#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) (mod ~N~0 4294967296))), 1500553#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 1500466#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 1500544#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 1500548#(and (or (<= (mod ~N~0 4294967296) 0) (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1500533#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 1500545#(and (or (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1500557#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 1500536#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)))] [2022-03-15 19:37:14,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:37:14,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:37:14,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2206, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:37:14,299 INFO L87 Difference]: Start difference. First operand 37218 states and 189955 transitions. Second operand has 38 states, 38 states have (on average 6.7105263157894735) internal successors, (255), 38 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:28,627 INFO L93 Difference]: Finished difference Result 106016 states and 485130 transitions. [2022-03-15 19:37:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-03-15 19:37:28,628 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.7105263157894735) internal successors, (255), 38 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:37:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:29,241 INFO L225 Difference]: With dead ends: 106016 [2022-03-15 19:37:29,242 INFO L226 Difference]: Without dead ends: 105220 [2022-03-15 19:37:29,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 473 SyntacticMatches, 22 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13708 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=4011, Invalid=36591, Unknown=0, NotChecked=0, Total=40602 [2022-03-15 19:37:29,243 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 973 mSDsluCounter, 5398 mSDsCounter, 0 mSdLazyCounter, 8897 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 9260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 8897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:29,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [973 Valid, 1150 Invalid, 9260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 8897 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 19:37:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105220 states. [2022-03-15 19:37:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105220 to 39718. [2022-03-15 19:37:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39718 states, 39717 states have (on average 5.153964297404134) internal successors, (204700), 39717 states have internal predecessors, (204700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39718 states to 39718 states and 204700 transitions. [2022-03-15 19:37:31,216 INFO L78 Accepts]: Start accepts. Automaton has 39718 states and 204700 transitions. Word has length 34 [2022-03-15 19:37:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:31,216 INFO L470 AbstractCegarLoop]: Abstraction has 39718 states and 204700 transitions. [2022-03-15 19:37:31,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.7105263157894735) internal successors, (255), 38 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 39718 states and 204700 transitions. [2022-03-15 19:37:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:37:31,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:31,326 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:31,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:31,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 19:37:31,536 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:37:31,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash -561425343, now seen corresponding path program 32 times [2022-03-15 19:37:31,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:31,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597935940] [2022-03-15 19:37:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:31,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:31,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:31,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597935940] [2022-03-15 19:37:31,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597935940] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:31,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334713881] [2022-03-15 19:37:31,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:37:31,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:31,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:31,720 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:31,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:37:31,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:37:31,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:31,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:37:31,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:37:31,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:37:32,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334713881] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:32,125 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:32,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-03-15 19:37:32,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1609361584] [2022-03-15 19:37:32,125 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:32,264 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:32,351 INFO L252 McrAutomatonBuilder]: Finished intersection with 344 states and 900 transitions. [2022-03-15 19:37:32,352 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:39,326 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [1686696#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 1686709#(and (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1686708#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 1686699#(and (or (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1686695#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 1686704#(and (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 1686706#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 1686691#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 1686711#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1686712#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 1686692#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 1686693#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 1686689#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 1686622#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 1686700#(and (or (<= (mod ~N~0 4294967296) 0) (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 1686705#(and (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 1686707#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 1686701#(and (or (<= (mod ~N~0 4294967296) 0) (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) 0) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1686698#(and (or (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0))), 1686697#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 1686690#(<= (mod ~N~0 4294967296) 0), 1686694#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 1686702#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 1686710#(and (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1686703#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296))))] [2022-03-15 19:37:39,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:37:39,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:39,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:37:39,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2110, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:37:39,327 INFO L87 Difference]: Start difference. First operand 39718 states and 204700 transitions. Second operand has 37 states, 37 states have (on average 6.72972972972973) internal successors, (249), 37 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:51,250 INFO L93 Difference]: Finished difference Result 103582 states and 473833 transitions. [2022-03-15 19:37:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-03-15 19:37:51,250 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 6.72972972972973) internal successors, (249), 37 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:37:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:51,999 INFO L225 Difference]: With dead ends: 103582 [2022-03-15 19:37:51,999 INFO L226 Difference]: Without dead ends: 102812 [2022-03-15 19:37:52,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 442 SyntacticMatches, 10 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7934 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2794, Invalid=22966, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 19:37:52,001 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 649 mSDsluCounter, 5383 mSDsCounter, 0 mSdLazyCounter, 9397 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 9589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 9397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:52,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [649 Valid, 1181 Invalid, 9589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 9397 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-03-15 19:37:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102812 states. [2022-03-15 19:37:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102812 to 40952. [2022-03-15 19:37:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40952 states, 40951 states have (on average 5.1268833483919805) internal successors, (209951), 40951 states have internal predecessors, (209951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40952 states to 40952 states and 209951 transitions. [2022-03-15 19:37:54,064 INFO L78 Accepts]: Start accepts. Automaton has 40952 states and 209951 transitions. Word has length 34 [2022-03-15 19:37:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:54,065 INFO L470 AbstractCegarLoop]: Abstraction has 40952 states and 209951 transitions. [2022-03-15 19:37:54,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.72972972972973) internal successors, (249), 37 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 40952 states and 209951 transitions. [2022-03-15 19:37:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:37:54,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:54,370 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:54,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:54,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 19:37:54,583 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:37:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash 509116740, now seen corresponding path program 33 times [2022-03-15 19:37:54,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:54,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825760694] [2022-03-15 19:37:54,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:37:54,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:54,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825760694] [2022-03-15 19:37:54,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825760694] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:54,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74211291] [2022-03-15 19:37:54,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:37:54,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:54,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:54,686 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:54,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:37:54,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:37:54,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:54,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:37:54,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:37:54,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:37:55,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74211291] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:55,150 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:55,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-03-15 19:37:55,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [194697439] [2022-03-15 19:37:55,150 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:55,153 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:55,207 INFO L252 McrAutomatonBuilder]: Finished intersection with 260 states and 648 transitions. [2022-03-15 19:37:55,207 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:59,500 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1872758#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 1872762#(and (or (<= (mod ~N~0 4294967296) 0) (<= 1 thread1Thread1of1ForFork2_~i~0)) (or (<= (mod ~N~0 4294967296) 0) (<= (+ ~N~0 thread1Thread1of1ForFork2_~i~0) (+ 4294967296 (* (div ~N~0 4294967296) 4294967296))))), 1872756#(<= (mod ~N~0 4294967296) 0), 1872760#(or (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 1872764#(and (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (+ ~N~0 thread1Thread1of1ForFork2_~i~0) (+ 4294967295 (* (div ~N~0 4294967296) 4294967296)))) (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 1872767#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 1872766#(and (or (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (+ ~N~0 thread1Thread1of1ForFork2_~i~0) (+ |thread2Thread1of1ForFork0_~i~1#1| 4294967295 (* (div ~N~0 4294967296) 4294967296))))), 1872757#(or (<= (+ (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296) 1)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 1872761#(and (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) thread1Thread1of1ForFork2_~i~0)) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (+ ~N~0 thread1Thread1of1ForFork2_~i~0) (+ |thread2Thread1of1ForFork0_~i~1#1| 4294967296 (* (div ~N~0 4294967296) 4294967296)))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) 0))), 1872763#(and (or (<= |thread2Thread1of1ForFork0_~i~1#1| thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (+ ~N~0 thread1Thread1of1ForFork2_~i~0) (+ |thread2Thread1of1ForFork0_~i~1#1| 4294967295 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 1872765#(and (or (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0))), 1872755#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 1872759#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)))] [2022-03-15 19:37:59,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:37:59,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:59,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:37:59,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:37:59,501 INFO L87 Difference]: Start difference. First operand 40952 states and 209951 transitions. Second operand has 22 states, 22 states have (on average 6.636363636363637) internal successors, (146), 22 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:03,675 INFO L93 Difference]: Finished difference Result 75312 states and 353096 transitions. [2022-03-15 19:38:03,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 19:38:03,676 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.636363636363637) internal successors, (146), 22 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:38:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:04,025 INFO L225 Difference]: With dead ends: 75312 [2022-03-15 19:38:04,025 INFO L226 Difference]: Without dead ends: 74726 [2022-03-15 19:38:04,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 300 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=670, Invalid=5030, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 19:38:04,026 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 481 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:04,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 457 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3151 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:38:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74726 states. [2022-03-15 19:38:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74726 to 40864. [2022-03-15 19:38:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40864 states, 40863 states have (on average 5.120353375914641) internal successors, (209233), 40863 states have internal predecessors, (209233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40864 states to 40864 states and 209233 transitions. [2022-03-15 19:38:05,936 INFO L78 Accepts]: Start accepts. Automaton has 40864 states and 209233 transitions. Word has length 34 [2022-03-15 19:38:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:05,936 INFO L470 AbstractCegarLoop]: Abstraction has 40864 states and 209233 transitions. [2022-03-15 19:38:05,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.636363636363637) internal successors, (146), 22 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 40864 states and 209233 transitions. [2022-03-15 19:38:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:38:06,040 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:06,040 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:06,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:06,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 19:38:06,241 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:38:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:06,241 INFO L85 PathProgramCache]: Analyzing trace with hash -905443353, now seen corresponding path program 34 times [2022-03-15 19:38:06,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:06,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320132811] [2022-03-15 19:38:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:06,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:06,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320132811] [2022-03-15 19:38:06,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320132811] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:06,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902258981] [2022-03-15 19:38:06,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:38:06,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:06,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:06,411 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:38:06,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:38:06,639 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:38:06,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:06,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:38:06,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:38:06,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:38:06,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902258981] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:06,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:06,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-03-15 19:38:06,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1991963142] [2022-03-15 19:38:06,911 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:06,914 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:06,992 INFO L252 McrAutomatonBuilder]: Finished intersection with 392 states and 1046 transitions. [2022-03-15 19:38:06,992 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:13,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [2030174#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 2030162#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ (* (div (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) 4294967296) ~N~0) (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1))), 2030179#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 2030160#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296))), 2030175#(and (or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 2030173#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 2030159#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) (mod ~N~0 4294967296))), 2030157#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 2030168#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2030177#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 2030166#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2030171#(and (<= 1 thread3Thread1of1ForFork1_~i~2) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (<= (+ ~N~0 thread3Thread1of1ForFork1_~i~2) (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 2030087#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 2030155#(<= (mod ~N~0 4294967296) 0), 2030178#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 2030172#(and (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2030164#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ (* (div (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) 4294967296) ~N~0) (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 2030165#(or (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ (* (div (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) 4294967296) ~N~0) (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) (mod ~N~0 4294967296))), 2030169#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ (* (div (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) 4294967296) ~N~0) (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1)) (< 2 (mod ~N~0 4294967296))), 2030154#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 2030163#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ (* (div (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) 4294967296) ~N~0) (+ thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296) 1))), 2030170#(and (<= thread3Thread1of1ForFork1_~i~2 4294967294) (<= 1 thread3Thread1of1ForFork1_~i~2)), 2030176#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2030161#(or (< (mod (+ 2 thread3Thread1of1ForFork1_~i~2) 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296))), 2030167#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2030158#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 2030156#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))] [2022-03-15 19:38:13,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:38:13,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:13,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:38:13,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:38:13,022 INFO L87 Difference]: Start difference. First operand 40864 states and 209233 transitions. Second operand has 39 states, 39 states have (on average 7.205128205128205) internal successors, (281), 39 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:28,992 INFO L93 Difference]: Finished difference Result 110820 states and 527491 transitions. [2022-03-15 19:38:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-03-15 19:38:28,992 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.205128205128205) internal successors, (281), 39 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:38:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:29,854 INFO L225 Difference]: With dead ends: 110820 [2022-03-15 19:38:29,854 INFO L226 Difference]: Without dead ends: 109892 [2022-03-15 19:38:29,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 518 SyntacticMatches, 17 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13680 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=4402, Invalid=35398, Unknown=0, NotChecked=0, Total=39800 [2022-03-15 19:38:29,856 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 703 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 7265 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 7646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 7265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:29,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [703 Valid, 1010 Invalid, 7646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 7265 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-03-15 19:38:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109892 states. [2022-03-15 19:38:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109892 to 43728. [2022-03-15 19:38:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43728 states, 43727 states have (on average 5.151599698127015) internal successors, (225264), 43727 states have internal predecessors, (225264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43728 states to 43728 states and 225264 transitions. [2022-03-15 19:38:32,214 INFO L78 Accepts]: Start accepts. Automaton has 43728 states and 225264 transitions. Word has length 34 [2022-03-15 19:38:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:32,214 INFO L470 AbstractCegarLoop]: Abstraction has 43728 states and 225264 transitions. [2022-03-15 19:38:32,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.205128205128205) internal successors, (281), 39 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 43728 states and 225264 transitions. [2022-03-15 19:38:32,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:38:32,331 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:32,331 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:32,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:32,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:38:32,535 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:38:32,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1169147609, now seen corresponding path program 35 times [2022-03-15 19:38:32,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:32,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190489996] [2022-03-15 19:38:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:32,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:32,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190489996] [2022-03-15 19:38:32,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190489996] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:32,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491547571] [2022-03-15 19:38:32,672 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:38:32,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:32,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:32,674 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:38:32,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:38:32,783 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:38:32,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:32,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:38:32,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:32,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:33,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491547571] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:33,191 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:33,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-03-15 19:38:33,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1059521668] [2022-03-15 19:38:33,191 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:33,194 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:33,269 INFO L252 McrAutomatonBuilder]: Finished intersection with 368 states and 970 transitions. [2022-03-15 19:38:33,270 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:39,013 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [2229133#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 2229139#(and (<= 1 thread3Thread1of1ForFork1_~i~2) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (<= (+ ~N~0 thread3Thread1of1ForFork1_~i~2) (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 2229140#(and (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2229149#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 2229134#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 2229129#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 2229145#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2229126#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 2229128#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 2229127#(<= (mod ~N~0 4294967296) 0), 2229148#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 2229137#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 2229138#(and (<= thread3Thread1of1ForFork1_~i~2 4294967294) (<= 1 thread3Thread1of1ForFork1_~i~2)), 2229130#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 2229132#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 2229143#(and (or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 2229142#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 2229144#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2229146#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 2229136#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~N~0 4294967296) 4294967296)) (+ (* (div (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) 4294967296) ~N~0)) (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296))), 2229135#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 2229141#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 2229147#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 2229131#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0)))] [2022-03-15 19:38:39,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:38:39,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:39,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:38:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2074, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:38:39,014 INFO L87 Difference]: Start difference. First operand 43728 states and 225264 transitions. Second operand has 36 states, 36 states have (on average 7.277777777777778) internal successors, (262), 36 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:03,636 INFO L93 Difference]: Finished difference Result 117906 states and 544734 transitions. [2022-03-15 19:39:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2022-03-15 19:39:03,636 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.277777777777778) internal successors, (262), 36 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:39:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:04,421 INFO L225 Difference]: With dead ends: 117906 [2022-03-15 19:39:04,421 INFO L226 Difference]: Without dead ends: 117002 [2022-03-15 19:39:04,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 534 SyntacticMatches, 11 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18797 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=5385, Invalid=47285, Unknown=0, NotChecked=0, Total=52670 [2022-03-15 19:39:04,423 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 599 mSDsluCounter, 6094 mSDsCounter, 0 mSdLazyCounter, 10045 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 10332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 10045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:04,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [599 Valid, 1346 Invalid, 10332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 10045 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-03-15 19:39:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117002 states. [2022-03-15 19:39:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117002 to 46178. [2022-03-15 19:39:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46178 states, 46177 states have (on average 5.170907594689997) internal successors, (238777), 46177 states have internal predecessors, (238777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46178 states to 46178 states and 238777 transitions. [2022-03-15 19:39:06,833 INFO L78 Accepts]: Start accepts. Automaton has 46178 states and 238777 transitions. Word has length 34 [2022-03-15 19:39:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:06,833 INFO L470 AbstractCegarLoop]: Abstraction has 46178 states and 238777 transitions. [2022-03-15 19:39:06,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.277777777777778) internal successors, (262), 36 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 46178 states and 238777 transitions. [2022-03-15 19:39:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:39:07,167 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:07,167 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:07,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 19:39:07,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:39:07,368 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:39:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1454767035, now seen corresponding path program 36 times [2022-03-15 19:39:07,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:07,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435277461] [2022-03-15 19:39:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:07,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:39:07,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:07,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435277461] [2022-03-15 19:39:07,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435277461] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:07,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173953485] [2022-03-15 19:39:07,522 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:39:07,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:07,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:07,523 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:39:07,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:39:07,723 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:39:07,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:07,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:39:07,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:39:07,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:39:07,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173953485] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:07,988 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:07,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-03-15 19:39:07,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1543468001] [2022-03-15 19:39:07,988 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:07,991 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:08,071 INFO L252 McrAutomatonBuilder]: Finished intersection with 388 states and 1036 transitions. [2022-03-15 19:39:08,072 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:13,611 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [2440199#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 2440193#(or (<= (mod ~N~0 4294967296) 1) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< 2 (mod ~N~0 4294967296))), 2440181#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 2440187#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2440198#(and (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2440192#(or (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) (mod ~N~0 4294967296))), 2440184#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 2440185#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 2440202#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 2440188#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296) (mod ~N~0 4294967296))), 2440186#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2440194#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (< 2 (mod ~N~0 4294967296))), 2440191#(or (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) (mod ~N~0 4294967296))), 2440200#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2440203#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 2440183#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 2440111#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 2440196#(and (<= thread3Thread1of1ForFork1_~i~2 4294967294) (<= 1 thread3Thread1of1ForFork1_~i~2)), 2440182#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2440190#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 2440195#(and (<= (div thread3Thread1of1ForFork1_~i~2 4294967296) 0) (<= 2 thread3Thread1of1ForFork1_~i~2)), 2440180#(<= (mod ~N~0 4294967296) 0), 2440197#(and (<= 1 thread3Thread1of1ForFork1_~i~2) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (<= (+ ~N~0 thread3Thread1of1ForFork1_~i~2) (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 2440189#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296))), 2440179#(and (or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 2440201#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 2440178#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0)))] [2022-03-15 19:39:13,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:39:13,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:39:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2287, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:39:13,612 INFO L87 Difference]: Start difference. First operand 46178 states and 238777 transitions. Second operand has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:30,508 INFO L93 Difference]: Finished difference Result 108354 states and 520495 transitions. [2022-03-15 19:39:30,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-03-15 19:39:30,508 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:39:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:31,065 INFO L225 Difference]: With dead ends: 108354 [2022-03-15 19:39:31,066 INFO L226 Difference]: Without dead ends: 107860 [2022-03-15 19:39:31,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 524 SyntacticMatches, 22 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15907 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=4806, Invalid=41204, Unknown=0, NotChecked=0, Total=46010 [2022-03-15 19:39:31,067 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 820 mSDsluCounter, 5836 mSDsCounter, 0 mSdLazyCounter, 9846 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 10298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 9846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:31,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [820 Valid, 1333 Invalid, 10298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 9846 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-03-15 19:39:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107860 states. [2022-03-15 19:39:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107860 to 54910. [2022-03-15 19:39:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54910 states, 54909 states have (on average 5.273452439490794) internal successors, (289560), 54909 states have internal predecessors, (289560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54910 states to 54910 states and 289560 transitions. [2022-03-15 19:39:33,854 INFO L78 Accepts]: Start accepts. Automaton has 54910 states and 289560 transitions. Word has length 34 [2022-03-15 19:39:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:33,854 INFO L470 AbstractCegarLoop]: Abstraction has 54910 states and 289560 transitions. [2022-03-15 19:39:33,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 54910 states and 289560 transitions. [2022-03-15 19:39:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:39:34,089 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:34,089 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:34,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-03-15 19:39:34,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-03-15 19:39:34,293 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:39:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash 775437637, now seen corresponding path program 37 times [2022-03-15 19:39:34,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:34,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931579803] [2022-03-15 19:39:34,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:34,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:39:34,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:34,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931579803] [2022-03-15 19:39:34,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931579803] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:34,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635424917] [2022-03-15 19:39:34,512 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:39:34,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:34,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:34,530 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:39:34,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 19:39:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:34,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:39:34,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:39:34,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:39:35,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635424917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:35,004 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:35,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-03-15 19:39:35,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [523549667] [2022-03-15 19:39:35,004 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:35,006 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:35,219 INFO L252 McrAutomatonBuilder]: Finished intersection with 384 states and 1026 transitions. [2022-03-15 19:39:35,219 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:41,211 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [2659100#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 2659101#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~N~0 4294967296) 4294967296)) (+ (* (div (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) 4294967296) ~N~0)) (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296))), 2659105#(or (<= (mod ~N~0 4294967296) 1) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 2659107#(and (<= (div thread3Thread1of1ForFork1_~i~2 4294967296) 0) (<= 2 thread3Thread1of1ForFork1_~i~2)), 2659112#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2659102#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 2659110#(and (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2659098#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 2659114#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 2659117#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 2659094#(and (or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 2659095#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 2659113#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2659099#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 2659096#(<= (mod ~N~0 4294967296) 0), 2659109#(and (<= 1 thread3Thread1of1ForFork1_~i~2) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (<= (+ ~N~0 thread3Thread1of1ForFork1_~i~2) (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 2659097#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 2659106#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 2659111#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 2659026#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 2659116#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 2659093#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 2659108#(and (<= thread3Thread1of1ForFork1_~i~2 4294967294) (<= 1 thread3Thread1of1ForFork1_~i~2)), 2659103#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 2659115#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 2659104#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~N~0 4294967296) 4294967296)) (+ (* (div (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) 4294967296) ~N~0)) (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296)))] [2022-03-15 19:39:41,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:39:41,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:41,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:39:41,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2197, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:39:41,212 INFO L87 Difference]: Start difference. First operand 54910 states and 289560 transitions. Second operand has 38 states, 38 states have (on average 7.2894736842105265) internal successors, (277), 38 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:57,427 INFO L93 Difference]: Finished difference Result 107122 states and 507914 transitions. [2022-03-15 19:39:57,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-03-15 19:39:57,427 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.2894736842105265) internal successors, (277), 38 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:39:57,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:58,235 INFO L225 Difference]: With dead ends: 107122 [2022-03-15 19:39:58,235 INFO L226 Difference]: Without dead ends: 106740 [2022-03-15 19:39:58,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 518 SyntacticMatches, 10 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12911 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3921, Invalid=35481, Unknown=0, NotChecked=0, Total=39402 [2022-03-15 19:39:58,237 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 654 mSDsluCounter, 5421 mSDsCounter, 0 mSdLazyCounter, 8983 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 9338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 8983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:58,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 1221 Invalid, 9338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 8983 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-03-15 19:39:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106740 states. [2022-03-15 19:40:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106740 to 55012. [2022-03-15 19:40:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55012 states, 55011 states have (on average 5.261983966842995) internal successors, (289467), 55011 states have internal predecessors, (289467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55012 states to 55012 states and 289467 transitions. [2022-03-15 19:40:00,804 INFO L78 Accepts]: Start accepts. Automaton has 55012 states and 289467 transitions. Word has length 34 [2022-03-15 19:40:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:00,805 INFO L470 AbstractCegarLoop]: Abstraction has 55012 states and 289467 transitions. [2022-03-15 19:40:00,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.2894736842105265) internal successors, (277), 38 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 55012 states and 289467 transitions. [2022-03-15 19:40:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:40:00,968 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:00,968 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:00,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:01,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 19:40:01,169 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:40:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1655685785, now seen corresponding path program 38 times [2022-03-15 19:40:01,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:01,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547823854] [2022-03-15 19:40:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:40:01,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:01,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547823854] [2022-03-15 19:40:01,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547823854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:01,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264353261] [2022-03-15 19:40:01,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:40:01,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:01,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:01,315 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:40:01,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 19:40:01,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:40:01,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:01,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:40:01,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:40:01,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:40:01,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264353261] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:01,850 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:01,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-03-15 19:40:01,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1527651545] [2022-03-15 19:40:01,850 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:01,853 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:01,938 INFO L252 McrAutomatonBuilder]: Finished intersection with 432 states and 1194 transitions. [2022-03-15 19:40:01,939 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:09,049 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [2876949#(<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0), 2876958#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2876938#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 2876935#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~N~0 4294967296) 4294967296)) (+ (* (div (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) 4294967296) ~N~0)) (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296))), 2876948#(or (<= (mod ~N~0 4294967296) 1) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 2876939#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 2876942#(or (<= (mod ~N~0 4294967296) 1) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 2876959#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 2876950#(and (<= (div thread3Thread1of1ForFork1_~i~2 4294967296) 0) (<= 2 thread3Thread1of1ForFork1_~i~2)), 2876944#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 2876956#(and (or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)) (or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))), 2876934#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 2876955#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 2876961#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))), 2876936#(<= (mod ~N~0 4294967296) 0), 2876953#(and (<= ~N~0 (+ 4294967294 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2876943#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~N~0 4294967296) 4294967296)) (+ (* (div (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) 4294967296) ~N~0)) (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296))), 2876954#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 2876941#(or (<= (mod ~N~0 4294967296) 1) (<= (+ 3 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 2876940#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~N~0 4294967296) 4294967296)) (+ (* (div (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) 4294967296) ~N~0)) (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296))), 2876951#(and (<= thread3Thread1of1ForFork1_~i~2 4294967294) (<= 1 thread3Thread1of1ForFork1_~i~2)), 2876952#(and (<= 1 thread3Thread1of1ForFork1_~i~2) (<= (div thread1Thread1of1ForFork2_~i~0 4294967296) 0) (<= (+ ~N~0 thread3Thread1of1ForFork1_~i~2) (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 2876947#(or (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 3 (* (div ~N~0 4294967296) 4294967296)) (+ (* (div (+ |thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) 4294967296) ~N~0)) (<= (mod ~N~0 4294967296) (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 2876962#(or (<= (mod ~N~0 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 2876946#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 2 (* (div ~N~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296)) ~N~0))), 2876957#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 2876945#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 2876867#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 2876937#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 2876960#(and (or (<= (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= ~N~0 (+ 4294967295 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))))] [2022-03-15 19:40:09,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:40:09,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:40:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2563, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:40:09,050 INFO L87 Difference]: Start difference. First operand 55012 states and 289467 transitions. Second operand has 42 states, 42 states have (on average 7.333333333333333) internal successors, (308), 42 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:39,751 INFO L93 Difference]: Finished difference Result 122544 states and 588683 transitions. [2022-03-15 19:40:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2022-03-15 19:40:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.333333333333333) internal successors, (308), 42 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:40:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:40,605 INFO L225 Difference]: With dead ends: 122544 [2022-03-15 19:40:40,605 INFO L226 Difference]: Without dead ends: 121740 [2022-03-15 19:40:40,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 630 SyntacticMatches, 11 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25582 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=6964, Invalid=66748, Unknown=0, NotChecked=0, Total=73712 [2022-03-15 19:40:40,608 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 769 mSDsluCounter, 7746 mSDsCounter, 0 mSdLazyCounter, 13291 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 13753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 13291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:40,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [769 Valid, 1967 Invalid, 13753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 13291 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-03-15 19:40:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121740 states. [2022-03-15 19:40:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121740 to 55784. [2022-03-15 19:40:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55784 states, 55783 states have (on average 5.258071455461342) internal successors, (293311), 55783 states have internal predecessors, (293311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55784 states to 55784 states and 293311 transitions. [2022-03-15 19:40:43,375 INFO L78 Accepts]: Start accepts. Automaton has 55784 states and 293311 transitions. Word has length 34 [2022-03-15 19:40:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:43,376 INFO L470 AbstractCegarLoop]: Abstraction has 55784 states and 293311 transitions. [2022-03-15 19:40:43,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.333333333333333) internal successors, (308), 42 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 55784 states and 293311 transitions. [2022-03-15 19:40:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:40:43,729 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:43,729 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:43,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:43,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 19:40:43,930 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:40:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1373398786, now seen corresponding path program 39 times [2022-03-15 19:40:43,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:43,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108614019] [2022-03-15 19:40:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:40:44,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:44,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108614019] [2022-03-15 19:40:44,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108614019] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:44,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916485988] [2022-03-15 19:40:44,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:40:44,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:44,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:44,038 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:40:44,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 19:40:44,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:40:44,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:44,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:40:44,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:40:44,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:40:44,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916485988] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:44,667 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:44,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 19:40:44,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379395144] [2022-03-15 19:40:44,667 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:44,670 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:44,720 INFO L252 McrAutomatonBuilder]: Finished intersection with 246 states and 612 transitions. [2022-03-15 19:40:44,720 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:46,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [3111949#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 3111952#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 3111946#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 3111948#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 3111947#(<= (mod ~N~0 4294967296) 0), 3111950#(or (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 3111951#(and (<= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork0_~i~1#1|))] [2022-03-15 19:40:46,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:40:46,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:40:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:40:46,396 INFO L87 Difference]: Start difference. First operand 55784 states and 293311 transitions. Second operand has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:48,069 INFO L93 Difference]: Finished difference Result 77024 states and 386370 transitions. [2022-03-15 19:40:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:40:48,069 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:40:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:48,534 INFO L225 Difference]: With dead ends: 77024 [2022-03-15 19:40:48,535 INFO L226 Difference]: Without dead ends: 76894 [2022-03-15 19:40:48,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 272 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1667, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:40:48,535 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 225 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:48,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 308 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:40:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76894 states. [2022-03-15 19:40:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76894 to 57582. [2022-03-15 19:40:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57582 states, 57581 states have (on average 5.278650943887741) internal successors, (303950), 57581 states have internal predecessors, (303950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57582 states to 57582 states and 303950 transitions. [2022-03-15 19:40:51,023 INFO L78 Accepts]: Start accepts. Automaton has 57582 states and 303950 transitions. Word has length 34 [2022-03-15 19:40:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:51,024 INFO L470 AbstractCegarLoop]: Abstraction has 57582 states and 303950 transitions. [2022-03-15 19:40:51,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 57582 states and 303950 transitions. [2022-03-15 19:40:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:40:51,228 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:51,228 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:51,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:51,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:51,429 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:40:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1519618238, now seen corresponding path program 40 times [2022-03-15 19:40:51,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:51,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582558334] [2022-03-15 19:40:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:40:51,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:51,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582558334] [2022-03-15 19:40:51,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582558334] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:51,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957496648] [2022-03-15 19:40:51,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:40:51,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:51,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:51,525 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:40:51,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 19:40:51,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:40:51,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:51,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:40:51,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:40:51,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:40:51,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957496648] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:51,905 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:51,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 19:40:51,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [662986098] [2022-03-15 19:40:51,905 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:51,908 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:51,960 INFO L252 McrAutomatonBuilder]: Finished intersection with 230 states and 566 transitions. [2022-03-15 19:40:51,960 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:53,625 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [3304422#(= thread3Thread1of1ForFork1_~i~2 0), 3304418#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 3304415#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 3304420#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 3304421#(and (<= 1 thread3Thread1of1ForFork1_~i~2) (<= thread3Thread1of1ForFork1_~i~2 1)), 3304416#(<= (mod ~N~0 4294967296) 0), 3304417#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 3304419#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)))] [2022-03-15 19:40:53,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:40:53,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:53,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:40:53,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:40:53,626 INFO L87 Difference]: Start difference. First operand 57582 states and 303950 transitions. Second operand has 17 states, 17 states have (on average 7.529411764705882) internal successors, (128), 17 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:55,534 INFO L93 Difference]: Finished difference Result 94412 states and 477849 transitions. [2022-03-15 19:40:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:40:55,535 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.529411764705882) internal successors, (128), 17 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:40:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:56,018 INFO L225 Difference]: With dead ends: 94412 [2022-03-15 19:40:56,018 INFO L226 Difference]: Without dead ends: 93246 [2022-03-15 19:40:56,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 255 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1667, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:40:56,019 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 294 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:56,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 246 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:40:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93246 states. [2022-03-15 19:40:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93246 to 68268. [2022-03-15 19:40:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68268 states, 68267 states have (on average 5.33735186839908) internal successors, (364365), 68267 states have internal predecessors, (364365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68268 states to 68268 states and 364365 transitions. [2022-03-15 19:40:59,171 INFO L78 Accepts]: Start accepts. Automaton has 68268 states and 364365 transitions. Word has length 34 [2022-03-15 19:40:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:59,171 INFO L470 AbstractCegarLoop]: Abstraction has 68268 states and 364365 transitions. [2022-03-15 19:40:59,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.529411764705882) internal successors, (128), 17 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 68268 states and 364365 transitions. [2022-03-15 19:40:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:40:59,396 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:59,397 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:59,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:59,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:59,600 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:40:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 869992718, now seen corresponding path program 41 times [2022-03-15 19:40:59,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:59,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747557419] [2022-03-15 19:40:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:40:59,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:59,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747557419] [2022-03-15 19:40:59,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747557419] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:59,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237215849] [2022-03-15 19:40:59,676 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:40:59,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:59,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:59,677 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:40:59,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 19:40:59,820 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:40:59,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:59,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:40:59,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:40:59,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:41:00,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237215849] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:00,089 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:00,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-03-15 19:41:00,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1563538407] [2022-03-15 19:41:00,089 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:00,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:00,301 INFO L252 McrAutomatonBuilder]: Finished intersection with 224 states and 551 transitions. [2022-03-15 19:41:00,301 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:02,013 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [3535646#(or (<= (mod ~N~0 4294967296) 0) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 3535648#(or (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| (* (div ~N~0 4294967296) 4294967296) 1) (+ ~N~0 (* (div |thread2Thread1of1ForFork0_~i~1#1| 4294967296) 4294967296)))), 3535645#(<= (mod ~N~0 4294967296) 0), 3535651#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 3535650#(and (<= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork0_~i~1#1|)), 3535649#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 3535647#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))] [2022-03-15 19:41:02,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:41:02,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:02,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:41:02,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:41:02,014 INFO L87 Difference]: Start difference. First operand 68268 states and 364365 transitions. Second operand has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:04,334 INFO L93 Difference]: Finished difference Result 115880 states and 590024 transitions. [2022-03-15 19:41:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:41:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:41:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:05,183 INFO L225 Difference]: With dead ends: 115880 [2022-03-15 19:41:05,183 INFO L226 Difference]: Without dead ends: 115476 [2022-03-15 19:41:05,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 241 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=1850, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:41:05,183 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 307 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:05,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 272 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:41:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115476 states. [2022-03-15 19:41:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115476 to 74564. [2022-03-15 19:41:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74564 states, 74563 states have (on average 5.355216394190148) internal successors, (399301), 74563 states have internal predecessors, (399301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74564 states to 74564 states and 399301 transitions. [2022-03-15 19:41:08,299 INFO L78 Accepts]: Start accepts. Automaton has 74564 states and 399301 transitions. Word has length 34 [2022-03-15 19:41:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:08,299 INFO L470 AbstractCegarLoop]: Abstraction has 74564 states and 399301 transitions. [2022-03-15 19:41:08,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 74564 states and 399301 transitions. [2022-03-15 19:41:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:41:08,860 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:08,860 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:08,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:09,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 19:41:09,063 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2081604492, now seen corresponding path program 42 times [2022-03-15 19:41:09,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:09,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907096968] [2022-03-15 19:41:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:09,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:09,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907096968] [2022-03-15 19:41:09,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907096968] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:09,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461740616] [2022-03-15 19:41:09,191 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:41:09,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:09,192 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:41:09,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 19:41:09,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:41:09,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:09,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:41:09,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:09,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:09,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461740616] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:09,619 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:09,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 21 [2022-03-15 19:41:09,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995966190] [2022-03-15 19:41:09,619 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:09,622 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:09,691 INFO L252 McrAutomatonBuilder]: Finished intersection with 318 states and 852 transitions. [2022-03-15 19:41:09,691 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:14,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [3800959#(= thread3Thread1of1ForFork1_~i~2 0), 3800936#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 3800956#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 3800949#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= ~N~0 (+ 2 (* (div ~N~0 4294967296) 4294967296)))), 3800953#(and (<= ~N~0 (+ 4294967294 thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296))) (<= (div thread3Thread1of1ForFork1_~i~2 4294967296) 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork0_~i~1#1|)), 3800933#(or (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 3800932#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 3800957#(and (<= ~N~0 (+ 4294967294 thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296))) (<= (div thread3Thread1of1ForFork1_~i~2 4294967296) 0)), 3800939#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296))), 3800940#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 3800934#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 3800946#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (<= (+ ~N~0 (* (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 4294967296)) (+ 2 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 3800954#(and (<= ~N~0 (+ 4294967294 thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296))) (<= (div thread3Thread1of1ForFork1_~i~2 4294967296) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 3800947#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)) (<= (+ ~N~0 (* (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 4294967296)) (+ 2 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296)))), 3800937#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 3800941#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 3800955#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), 3800942#(and (<= ~N~0 (+ 4294967294 thread3Thread1of1ForFork1_~i~2 (* (div ~N~0 4294967296) 4294967296))) (<= (div thread3Thread1of1ForFork1_~i~2 4294967296) 0) (= thread1Thread1of1ForFork2_~i~0 0)), 3800935#(<= (mod ~N~0 4294967296) 0), 3800938#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 3800948#(<= ~N~0 (+ 2 (* (div ~N~0 4294967296) 4294967296))), 3800952#(and (<= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= 0 (div (+ (- 1) |thread2Thread1of1ForFork0_~i~1#1|) 4294967296))), 3800944#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)) (<= (+ (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296) 1)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 3800943#(or (<= (+ (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) ~N~0) (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296) 1)) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))), 3800950#(or (<= (mod ~N~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (<= ~N~0 (+ 2 (* (div ~N~0 4294967296) 4294967296))) (< (mod (+ |thread2Thread1of1ForFork0_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))), 3800958#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 3800931#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~N~0 4294967296)), 3800951#(and (<= |thread2Thread1of1ForFork0_~i~1#1| 2) (<= 0 (div (+ (- 2) |thread2Thread1of1ForFork0_~i~1#1|) 4294967296))), 3800930#(< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296)), 3800945#(or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (<= (+ ~N~0 (* (div (+ 2 thread1Thread1of1ForFork2_~i~0) 4294967296) 4294967296)) (+ 2 thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296))))] [2022-03-15 19:41:14,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:41:14,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:14,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:41:14,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2178, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:41:14,632 INFO L87 Difference]: Start difference. First operand 74564 states and 399301 transitions. Second operand has 42 states, 42 states have (on average 6.380952380952381) internal successors, (268), 42 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:30,223 INFO L93 Difference]: Finished difference Result 144562 states and 742072 transitions. [2022-03-15 19:41:30,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 19:41:30,224 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.380952380952381) internal successors, (268), 42 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:41:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:31,265 INFO L225 Difference]: With dead ends: 144562 [2022-03-15 19:41:31,265 INFO L226 Difference]: Without dead ends: 144210 [2022-03-15 19:41:31,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 452 SyntacticMatches, 8 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14318 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=4182, Invalid=35220, Unknown=0, NotChecked=0, Total=39402 [2022-03-15 19:41:31,268 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 648 mSDsluCounter, 7041 mSDsCounter, 0 mSdLazyCounter, 12637 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 12900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 12637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:31,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 1704 Invalid, 12900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 12637 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-03-15 19:41:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144210 states. [2022-03-15 19:41:34,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144210 to 81380. [2022-03-15 19:41:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81380 states, 81379 states have (on average 5.384472652649946) internal successors, (438183), 81379 states have internal predecessors, (438183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81380 states to 81380 states and 438183 transitions. [2022-03-15 19:41:35,092 INFO L78 Accepts]: Start accepts. Automaton has 81380 states and 438183 transitions. Word has length 34 [2022-03-15 19:41:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:35,092 INFO L470 AbstractCegarLoop]: Abstraction has 81380 states and 438183 transitions. [2022-03-15 19:41:35,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.380952380952381) internal successors, (268), 42 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 81380 states and 438183 transitions. [2022-03-15 19:41:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:41:35,640 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:35,640 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:35,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:35,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 19:41:35,840 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash -665873042, now seen corresponding path program 43 times [2022-03-15 19:41:35,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:35,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508469390] [2022-03-15 19:41:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:41:35,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:35,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508469390] [2022-03-15 19:41:35,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508469390] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:35,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466629875] [2022-03-15 19:41:35,977 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:41:35,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:35,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:35,978 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:41:35,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 19:41:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:36,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:41:36,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:41:36,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:41:36,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466629875] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:36,368 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:36,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 19:41:36,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623644671] [2022-03-15 19:41:36,369 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:36,371 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:36,473 INFO L252 McrAutomatonBuilder]: Finished intersection with 464 states and 1290 transitions. [2022-03-15 19:41:36,473 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:40,974 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [4108951#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 4108952#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 4108957#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 4108950#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 4108956#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 4108955#(or (<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)) (<= (mod ~N~0 4294967296) (mod (+ thread3Thread1of1ForFork1_~i~2 1) 4294967296))), 4108954#(<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)), 4108953#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296) 1) (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0))), 4108958#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0)), 4108949#(<= (mod ~N~0 4294967296) 0)] [2022-03-15 19:41:40,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:41:40,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:40,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:41:40,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:41:40,975 INFO L87 Difference]: Start difference. First operand 81380 states and 438183 transitions. Second operand has 19 states, 19 states have (on average 8.68421052631579) internal successors, (165), 19 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:43,604 INFO L93 Difference]: Finished difference Result 107226 states and 548318 transitions. [2022-03-15 19:41:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:41:43,604 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.68421052631579) internal successors, (165), 19 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 19:41:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:44,184 INFO L225 Difference]: With dead ends: 107226 [2022-03-15 19:41:44,184 INFO L226 Difference]: Without dead ends: 107186 [2022-03-15 19:41:44,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 491 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=2302, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:41:44,185 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 230 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:44,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 368 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:41:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107186 states. [2022-03-15 19:41:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107186 to 81380. [2022-03-15 19:41:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81380 states, 81379 states have (on average 5.384177736271028) internal successors, (438159), 81379 states have internal predecessors, (438159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81380 states to 81380 states and 438159 transitions. [2022-03-15 19:41:47,610 INFO L78 Accepts]: Start accepts. Automaton has 81380 states and 438159 transitions. Word has length 35 [2022-03-15 19:41:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:47,610 INFO L470 AbstractCegarLoop]: Abstraction has 81380 states and 438159 transitions. [2022-03-15 19:41:47,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.68421052631579) internal successors, (165), 19 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 81380 states and 438159 transitions. [2022-03-15 19:41:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:41:48,189 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:48,189 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:48,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:48,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 19:41:48,392 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1911306816, now seen corresponding path program 44 times [2022-03-15 19:41:48,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:48,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290230538] [2022-03-15 19:41:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:41:48,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:48,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290230538] [2022-03-15 19:41:48,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290230538] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:48,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934000952] [2022-03-15 19:41:48,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:41:48,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:48,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:48,498 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:41:48,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 19:41:48,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:41:48,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:48,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:41:48,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:41:48,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:41:48,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934000952] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:48,888 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:48,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 19:41:48,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536682953] [2022-03-15 19:41:48,888 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:48,891 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:49,012 INFO L252 McrAutomatonBuilder]: Finished intersection with 444 states and 1224 transitions. [2022-03-15 19:41:49,012 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:53,262 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [4379242#(<= (mod ~N~0 4294967296) (mod thread3Thread1of1ForFork1_~i~2 4294967296)), 4379237#(<= (mod ~N~0 4294967296) 0), 4379243#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= thread3Thread1of1ForFork1_~i~2 0))), 4379240#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296))), 4379239#(< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)), 4379244#(and (or (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296))) (or (<= thread1Thread1of1ForFork2_~i~0 0) (<= (mod ~N~0 4294967296) (mod thread1Thread1of1ForFork2_~i~0 4294967296)))), 4379238#(or (<= (mod ~N~0 4294967296) 0) (< (mod thread1Thread1of1ForFork2_~i~0 4294967296) (mod ~N~0 4294967296))), 4379241#(or (< (mod thread3Thread1of1ForFork1_~i~2 4294967296) (mod ~N~0 4294967296)) (<= (+ thread1Thread1of1ForFork2_~i~0 (* (div ~N~0 4294967296) 4294967296) 1) (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) ~N~0))), 4379245#(or (<= (mod ~N~0 4294967296) 0) (= thread3Thread1of1ForFork1_~i~2 0))] [2022-03-15 19:41:53,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:41:53,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:53,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:41:53,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:41:53,263 INFO L87 Difference]: Start difference. First operand 81380 states and 438159 transitions. Second operand has 18 states, 18 states have (on average 8.666666666666666) internal successors, (156), 18 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:55,926 INFO L93 Difference]: Finished difference Result 130450 states and 667828 transitions. [2022-03-15 19:41:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:41:55,927 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.666666666666666) internal successors, (156), 18 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 19:41:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:56,929 INFO L225 Difference]: With dead ends: 130450 [2022-03-15 19:41:56,929 INFO L226 Difference]: Without dead ends: 128670 [2022-03-15 19:41:56,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 471 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=2108, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:41:56,930 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 196 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:56,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 356 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:41:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128670 states.