/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/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:01:44,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:01:44,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:01:44,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:01:44,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:01:44,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:01:44,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:01:44,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:01:44,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:01:44,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:01:44,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:01:44,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:01:44,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:01:44,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:01:44,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:01:44,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:01:44,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:01:44,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:01:44,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:01:44,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:01:44,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:01:44,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:01:44,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:01:44,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:01:44,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:01:44,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:01:44,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:01:44,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:01:44,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:01:44,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:01:44,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:01:44,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:01:44,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:01:44,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:01:44,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:01:44,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:01:44,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:01:44,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:01:44,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:01:44,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:01:44,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:01:44,684 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:01:44,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:01:44,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:01:44,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:01:44,707 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:01:44,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:01:44,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:01:44,707 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:01:44,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:01:44,708 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:01:44,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:01:44,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:01:44,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:01:44,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:01:44,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:01:44,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:01:44,709 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:01:44,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:01:44,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:01:44,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:01:44,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:01:44,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:01:44,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:01:44,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:01:44,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:01:44,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:01:44,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:01:44,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:01:44,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:01:44,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:01:44,710 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:01:44,710 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:01:44,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:01:44,710 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:01:44,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:01:44,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:01:44,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:01:44,908 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:01:44,909 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:01:44,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-03-15 19:01:44,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ff9544e/c9909d469ca140f79a4a89ec4a50e334/FLAG4e3b097ca [2022-03-15 19:01:45,285 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:01:45,285 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-03-15 19:01:45,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ff9544e/c9909d469ca140f79a4a89ec4a50e334/FLAG4e3b097ca [2022-03-15 19:01:45,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ff9544e/c9909d469ca140f79a4a89ec4a50e334 [2022-03-15 19:01:45,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:01:45,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:01:45,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:01:45,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:01:45,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:01:45,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6da29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45, skipping insertion in model container [2022-03-15 19:01:45,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:01:45,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:01:45,453 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/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-03-15 19:01:45,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:01:45,463 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:01:45,481 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/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-03-15 19:01:45,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:01:45,494 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:01:45,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45 WrapperNode [2022-03-15 19:01:45,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:01:45,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:01:45,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:01:45,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:01:45,501 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:01:45" (1/1) ... [2022-03-15 19:01:45,507 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:01:45" (1/1) ... [2022-03-15 19:01:45,537 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-03-15 19:01:45,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:01:45,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:01:45,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:01:45,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:01:45,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:01:45,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:01:45,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:01:45,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:01:45,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45" (1/1) ... [2022-03-15 19:01:45,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:01:45,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:45,603 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:01:45,609 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:01:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:01:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:01:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:01:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:01:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:01:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:01:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:01:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:01:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:01:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:01:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:01:45,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:01:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:01:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:01:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:01:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:01:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:01:45,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:01:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:01:45,640 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:01:45,740 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:01:45,741 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:01:46,031 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:01:46,176 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:01:46,176 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:01:46,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:01:46 BoogieIcfgContainer [2022-03-15 19:01:46,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:01:46,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:01:46,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:01:46,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:01:46,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:01:45" (1/3) ... [2022-03-15 19:01:46,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26456f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:01:46, skipping insertion in model container [2022-03-15 19:01:46,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:01:45" (2/3) ... [2022-03-15 19:01:46,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26456f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:01:46, skipping insertion in model container [2022-03-15 19:01:46,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:01:46" (3/3) ... [2022-03-15 19:01:46,185 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-03-15 19:01:46,189 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:01:46,189 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:01:46,190 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:01:46,190 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:01:46,238 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,238 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,238 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,238 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,238 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,239 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,239 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,239 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,239 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,239 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,239 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,240 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,240 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,240 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,240 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,240 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,241 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,242 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,242 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,242 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,242 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,242 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,242 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,246 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,246 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,250 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,251 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,252 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,252 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,252 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,252 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,253 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,253 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,253 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,253 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,253 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,253 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,253 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,254 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,254 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,254 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,256 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,257 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,261 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,261 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,261 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,261 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,261 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,264 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,264 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,265 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,265 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,270 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,270 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,271 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,271 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,271 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,271 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,271 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,272 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,272 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,282 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,282 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,284 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,285 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,285 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,287 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,287 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,287 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,288 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,288 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,288 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,288 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,289 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,289 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,289 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,289 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,289 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,289 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,289 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,297 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:01:46,305 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-03-15 19:01:46,340 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:01:46,345 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:01:46,345 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 19:01:46,359 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:01:46,365 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 205 transitions, 454 flow [2022-03-15 19:01:46,367 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 205 transitions, 454 flow [2022-03-15 19:01:46,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 205 transitions, 454 flow [2022-03-15 19:01:46,446 INFO L129 PetriNetUnfolder]: 14/190 cut-off events. [2022-03-15 19:01:46,446 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:01:46,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 190 events. 14/190 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 162 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2022-03-15 19:01:46,453 INFO L116 LiptonReduction]: Number of co-enabled transitions 2612 [2022-03-15 19:01:51,605 INFO L131 LiptonReduction]: Checked pairs total: 8123 [2022-03-15 19:01:51,605 INFO L133 LiptonReduction]: Total number of compositions: 182 [2022-03-15 19:01:51,610 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 49 transitions, 142 flow [2022-03-15 19:01:51,651 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 471 states, 470 states have (on average 3.3957446808510636) internal successors, (1596), 470 states have internal predecessors, (1596), 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:01:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 471 states, 470 states have (on average 3.3957446808510636) internal successors, (1596), 470 states have internal predecessors, (1596), 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:01:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:01:51,668 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:51,668 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, 1, 1] [2022-03-15 19:01:51,669 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:01:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1226819905, now seen corresponding path program 1 times [2022-03-15 19:01:51,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:51,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489562571] [2022-03-15 19:01:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:51,969 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:01:51,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:51,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489562571] [2022-03-15 19:01:51,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489562571] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:01:51,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:01:51,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:01:51,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924786165] [2022-03-15 19:01:51,971 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:51,980 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:52,026 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 230 transitions. [2022-03-15 19:01:52,026 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:52,867 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:01:52,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:01:52,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:52,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:01:52,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:01:52,883 INFO L87 Difference]: Start difference. First operand has 471 states, 470 states have (on average 3.3957446808510636) internal successors, (1596), 470 states have internal predecessors, (1596), 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 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:01:52,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:52,997 INFO L93 Difference]: Finished difference Result 1084 states and 3763 transitions. [2022-03-15 19:01:52,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:01:52,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:01:52,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:53,012 INFO L225 Difference]: With dead ends: 1084 [2022-03-15 19:01:53,012 INFO L226 Difference]: Without dead ends: 1065 [2022-03-15 19:01:53,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:01:53,014 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:53,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 36 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:01:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2022-03-15 19:01:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 721. [2022-03-15 19:01:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 3.3930555555555557) internal successors, (2443), 720 states have internal predecessors, (2443), 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:01:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2443 transitions. [2022-03-15 19:01:53,070 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2443 transitions. Word has length 31 [2022-03-15 19:01:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:53,071 INFO L470 AbstractCegarLoop]: Abstraction has 721 states and 2443 transitions. [2022-03-15 19:01:53,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:01:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2443 transitions. [2022-03-15 19:01:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:01:53,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:53,075 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, 1, 1] [2022-03-15 19:01:53,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:01:53,075 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:01:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1480133907, now seen corresponding path program 2 times [2022-03-15 19:01:53,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:53,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787527382] [2022-03-15 19:01:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:53,166 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:01:53,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:53,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787527382] [2022-03-15 19:01:53,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787527382] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:01:53,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:01:53,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:01:53,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395705916] [2022-03-15 19:01:53,167 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:53,173 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:53,196 INFO L252 McrAutomatonBuilder]: Finished intersection with 115 states and 226 transitions. [2022-03-15 19:01:53,196 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:53,950 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3685#(= ~s_2~0 0)] [2022-03-15 19:01:53,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:01:53,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:53,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:01:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:01:53,952 INFO L87 Difference]: Start difference. First operand 721 states and 2443 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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:01:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:54,077 INFO L93 Difference]: Finished difference Result 1360 states and 4755 transitions. [2022-03-15 19:01:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:01:54,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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:01:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:54,084 INFO L225 Difference]: With dead ends: 1360 [2022-03-15 19:01:54,084 INFO L226 Difference]: Without dead ends: 1341 [2022-03-15 19:01:54,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:01:54,085 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:54,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:01:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2022-03-15 19:01:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 725. [2022-03-15 19:01:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 3.388121546961326) internal successors, (2453), 724 states have internal predecessors, (2453), 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:01:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 2453 transitions. [2022-03-15 19:01:54,107 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 2453 transitions. Word has length 31 [2022-03-15 19:01:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:54,108 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 2453 transitions. [2022-03-15 19:01:54,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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:01:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 2453 transitions. [2022-03-15 19:01:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:54,110 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:54,110 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, 1, 1, 1] [2022-03-15 19:01:54,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:01:54,110 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:01:54,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash -624962275, now seen corresponding path program 1 times [2022-03-15 19:01:54,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:54,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733313630] [2022-03-15 19:01:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:54,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:54,187 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:01:54,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:54,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733313630] [2022-03-15 19:01:54,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733313630] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:01:54,188 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:01:54,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:01:54,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104321730] [2022-03-15 19:01:54,188 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:54,195 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:54,219 INFO L252 McrAutomatonBuilder]: Finished intersection with 129 states and 257 transitions. [2022-03-15 19:01:54,220 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:55,054 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:01:55,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:01:55,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:55,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:01:55,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:01:55,055 INFO L87 Difference]: Start difference. First operand 725 states and 2453 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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:01:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:55,157 INFO L93 Difference]: Finished difference Result 1433 states and 4719 transitions. [2022-03-15 19:01:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:01:55,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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:01:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:55,165 INFO L225 Difference]: With dead ends: 1433 [2022-03-15 19:01:55,165 INFO L226 Difference]: Without dead ends: 1365 [2022-03-15 19:01:55,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:01:55,166 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:55,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 43 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:01:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-03-15 19:01:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1235. [2022-03-15 19:01:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1234 states have (on average 3.3889789303079416) internal successors, (4182), 1234 states have internal predecessors, (4182), 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:01:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 4182 transitions. [2022-03-15 19:01:55,201 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 4182 transitions. Word has length 32 [2022-03-15 19:01:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:55,202 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 4182 transitions. [2022-03-15 19:01:55,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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:01:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 4182 transitions. [2022-03-15 19:01:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:01:55,205 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:55,205 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, 1, 1, 1, 1] [2022-03-15 19:01:55,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:01:55,205 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:01:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1314025826, now seen corresponding path program 1 times [2022-03-15 19:01:55,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:55,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10264339] [2022-03-15 19:01:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:55,264 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:01:55,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:55,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10264339] [2022-03-15 19:01:55,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10264339] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:01:55,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:01:55,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:01:55,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864358245] [2022-03-15 19:01:55,265 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:55,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:55,301 INFO L252 McrAutomatonBuilder]: Finished intersection with 148 states and 301 transitions. [2022-03-15 19:01:55,301 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:56,173 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [10418#(<= ~n_1~0 ~i_3~0), 10419#(and (or (= ~i_3~0 0) (< ~i_3~0 ~n_1~0)) (or (<= (+ ~n_1~0 1) 0) (< ~i_3~0 ~n_1~0))), 10417#(or (< (+ ~i_3~0 1) ~n_1~0) (<= ~n_1~0 ~i_3~0)), 10416#(< ~i_3~0 ~n_1~0)] [2022-03-15 19:01:56,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:01:56,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:01:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:01:56,174 INFO L87 Difference]: Start difference. First operand 1235 states and 4182 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:01:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:56,323 INFO L93 Difference]: Finished difference Result 937 states and 2817 transitions. [2022-03-15 19:01:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:01:56,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:01:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:56,326 INFO L225 Difference]: With dead ends: 937 [2022-03-15 19:01:56,326 INFO L226 Difference]: Without dead ends: 704 [2022-03-15 19:01:56,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:01:56,327 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 87 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:56,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 83 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:01:56,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-03-15 19:01:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2022-03-15 19:01:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 3.193456614509246) internal successors, (2245), 703 states have internal predecessors, (2245), 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:01:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 2245 transitions. [2022-03-15 19:01:56,343 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 2245 transitions. Word has length 33 [2022-03-15 19:01:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:56,343 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 2245 transitions. [2022-03-15 19:01:56,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:01:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 2245 transitions. [2022-03-15 19:01:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:01:56,346 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:56,346 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, 1, 1, 1, 1] [2022-03-15 19:01:56,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:01:56,346 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:01:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash -551905392, now seen corresponding path program 1 times [2022-03-15 19:01:56,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:56,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613960545] [2022-03-15 19:01:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:56,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:56,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613960545] [2022-03-15 19:01:56,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613960545] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:56,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663028546] [2022-03-15 19:01:56,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:56,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:56,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:56,414 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:01:56,442 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:01:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:56,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 19:01:56,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:56,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:56,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663028546] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:56,699 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:56,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:01:56,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [87777728] [2022-03-15 19:01:56,699 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:56,704 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:56,732 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 258 transitions. [2022-03-15 19:01:56,732 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:57,509 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:01:57,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:01:57,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:57,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:01:57,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:01:57,510 INFO L87 Difference]: Start difference. First operand 704 states and 2245 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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:01:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:57,648 INFO L93 Difference]: Finished difference Result 1390 states and 4302 transitions. [2022-03-15 19:01:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:01:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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:01:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:57,653 INFO L225 Difference]: With dead ends: 1390 [2022-03-15 19:01:57,653 INFO L226 Difference]: Without dead ends: 1234 [2022-03-15 19:01:57,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:01:57,654 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:57,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 59 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:01:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-03-15 19:01:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1126. [2022-03-15 19:01:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1125 states have (on average 3.2071111111111112) internal successors, (3608), 1125 states have internal predecessors, (3608), 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:01:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 3608 transitions. [2022-03-15 19:01:57,688 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 3608 transitions. Word has length 33 [2022-03-15 19:01:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:57,688 INFO L470 AbstractCegarLoop]: Abstraction has 1126 states and 3608 transitions. [2022-03-15 19:01:57,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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:01:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 3608 transitions. [2022-03-15 19:01:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:01:57,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:57,691 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, 1, 1, 1, 1, 1] [2022-03-15 19:01:57,710 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:01:57,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:57,908 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:01:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash 875842555, now seen corresponding path program 1 times [2022-03-15 19:01:57,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:57,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855886470] [2022-03-15 19:01:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:57,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:57,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:57,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855886470] [2022-03-15 19:01:57,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855886470] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:57,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498334263] [2022-03-15 19:01:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:57,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:57,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:57,970 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:01:57,971 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:01:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:58,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:01:58,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:58,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:58,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498334263] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:58,219 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:58,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:01:58,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1678369820] [2022-03-15 19:01:58,220 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:58,223 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:58,251 INFO L252 McrAutomatonBuilder]: Finished intersection with 143 states and 292 transitions. [2022-03-15 19:01:58,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:58,937 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [16831#(< ~i_3~0 ~n_1~0), 16832#(or (< (+ ~i_3~0 1) ~n_1~0) (<= ~n_1~0 ~i_3~0))] [2022-03-15 19:01:58,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:01:58,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:01:58,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:01:58,940 INFO L87 Difference]: Start difference. First operand 1126 states and 3608 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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:01:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:59,077 INFO L93 Difference]: Finished difference Result 806 states and 2448 transitions. [2022-03-15 19:01:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:01:59,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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:01:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:59,081 INFO L225 Difference]: With dead ends: 806 [2022-03-15 19:01:59,081 INFO L226 Difference]: Without dead ends: 705 [2022-03-15 19:01:59,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:01:59,081 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 68 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:59,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 78 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:01:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-03-15 19:01:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2022-03-15 19:01:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 3.190340909090909) internal successors, (2246), 704 states have internal predecessors, (2246), 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:01:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 2246 transitions. [2022-03-15 19:01:59,103 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 2246 transitions. Word has length 34 [2022-03-15 19:01:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:59,103 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 2246 transitions. [2022-03-15 19:01:59,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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:01:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 2246 transitions. [2022-03-15 19:01:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:01:59,105 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:59,105 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, 1, 1, 1, 1] [2022-03-15 19:01:59,132 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:01:59,321 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,SelfDestructingSolverStorable5 [2022-03-15 19:01:59,322 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:01:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1712857981, now seen corresponding path program 2 times [2022-03-15 19:01:59,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:59,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476949140] [2022-03-15 19:01:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:59,374 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:01:59,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:59,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476949140] [2022-03-15 19:01:59,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476949140] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:59,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819126559] [2022-03-15 19:01:59,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:01:59,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:59,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:59,383 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:01:59,384 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:01:59,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:01:59,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:59,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:01:59,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:01:59,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:01:59,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819126559] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:59,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:01:59,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2022-03-15 19:01:59,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2032814902] [2022-03-15 19:01:59,622 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:59,626 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:59,666 INFO L252 McrAutomatonBuilder]: Finished intersection with 131 states and 259 transitions. [2022-03-15 19:01:59,666 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:00,290 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:02:00,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:02:00,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:00,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:02:00,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:02:00,291 INFO L87 Difference]: Start difference. First operand 705 states and 2246 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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:02:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:00,349 INFO L93 Difference]: Finished difference Result 573 states and 1864 transitions. [2022-03-15 19:02:00,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:02:00,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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:02:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:00,352 INFO L225 Difference]: With dead ends: 573 [2022-03-15 19:02:00,352 INFO L226 Difference]: Without dead ends: 573 [2022-03-15 19:02:00,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:02:00,353 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 84 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:00,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 18 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:02:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-03-15 19:02:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 533. [2022-03-15 19:02:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 3.263157894736842) internal successors, (1736), 532 states have internal predecessors, (1736), 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:02:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1736 transitions. [2022-03-15 19:02:00,363 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1736 transitions. Word has length 34 [2022-03-15 19:02:00,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:00,363 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 1736 transitions. [2022-03-15 19:02:00,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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:02:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1736 transitions. [2022-03-15 19:02:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:02:00,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:00,364 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, 1, 1, 1, 1, 1] [2022-03-15 19:02:00,385 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:02:00,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:00,579 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1930936914, now seen corresponding path program 2 times [2022-03-15 19:02:00,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:00,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961353452] [2022-03-15 19:02:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:00,641 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:02:00,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:00,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961353452] [2022-03-15 19:02:00,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961353452] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:00,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724103741] [2022-03-15 19:02:00,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:02:00,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:00,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:00,642 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:02:00,647 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:02:00,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:02:00,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:00,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:02:00,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:02:00,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:02:00,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724103741] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:00,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:02:00,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2022-03-15 19:02:00,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [756193245] [2022-03-15 19:02:00,931 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:00,936 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:00,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 144 states and 293 transitions. [2022-03-15 19:02:00,972 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:01,717 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:02:01,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:02:01,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:01,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:02:01,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:02:01,718 INFO L87 Difference]: Start difference. First operand 533 states and 1736 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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:02:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:01,777 INFO L93 Difference]: Finished difference Result 639 states and 2104 transitions. [2022-03-15 19:02:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:02:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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:02:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:01,780 INFO L225 Difference]: With dead ends: 639 [2022-03-15 19:02:01,781 INFO L226 Difference]: Without dead ends: 639 [2022-03-15 19:02:01,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:02:01,781 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 93 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:01,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 25 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:02:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-03-15 19:02:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2022-03-15 19:02:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 3.2978056426332287) internal successors, (2104), 638 states have internal predecessors, (2104), 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:02:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2104 transitions. [2022-03-15 19:02:01,793 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 2104 transitions. Word has length 35 [2022-03-15 19:02:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:01,794 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 2104 transitions. [2022-03-15 19:02:01,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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:02:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 2104 transitions. [2022-03-15 19:02:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:01,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:01,795 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:01,812 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:02:01,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:01,999 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 268824144, now seen corresponding path program 1 times [2022-03-15 19:02:02,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:02,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340249822] [2022-03-15 19:02:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:02,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:02,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:02,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340249822] [2022-03-15 19:02:02,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340249822] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:02,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481174361] [2022-03-15 19:02:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:02,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:02,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:02,222 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:02:02,223 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:02:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:02,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:02:02,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:02,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:02,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:02,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:02,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:02,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 19:02:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:02,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:02,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_370) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-03-15 19:02:02,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_370 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_370) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-03-15 19:02:02,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_370 (Array Int Int))) (= (+ c_~t_4~0 (* (- 1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_370) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-03-15 19:02:02,778 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:02,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 89 [2022-03-15 19:02:02,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-03-15 19:02:02,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-03-15 19:02:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:02:02,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481174361] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:02,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:02,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2022-03-15 19:02:02,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1030074689] [2022-03-15 19:02:02,933 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:02,938 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:02,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 320 transitions. [2022-03-15 19:02:02,971 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:06,053 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [23278#(and (or (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (<= ~s_2~0 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (= ~X_0~0.offset 0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (= (+ ~X_0~0.offset (* ~i_3~0 4)) 0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= 0 ~s_2~0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 23276#(and (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) 4)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 23277#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) (+ ~s_2~0 ~t_4~0))) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)))] [2022-03-15 19:02:06,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:02:06,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:06,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:02:06,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=625, Unknown=3, NotChecked=156, Total=870 [2022-03-15 19:02:06,054 INFO L87 Difference]: Start difference. First operand 639 states and 2104 transitions. Second operand has 15 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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:02:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:07,034 INFO L93 Difference]: Finished difference Result 1588 states and 5393 transitions. [2022-03-15 19:02:07,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:02:07,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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 36 [2022-03-15 19:02:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:07,042 INFO L225 Difference]: With dead ends: 1588 [2022-03-15 19:02:07,042 INFO L226 Difference]: Without dead ends: 1547 [2022-03-15 19:02:07,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 158 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=286, Invalid=1615, Unknown=3, NotChecked=258, Total=2162 [2022-03-15 19:02:07,044 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 310 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:07,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 116 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:02:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-03-15 19:02:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 903. [2022-03-15 19:02:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 3.2971175166297115) internal successors, (2974), 902 states have internal predecessors, (2974), 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:02:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 2974 transitions. [2022-03-15 19:02:07,066 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 2974 transitions. Word has length 36 [2022-03-15 19:02:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:07,066 INFO L470 AbstractCegarLoop]: Abstraction has 903 states and 2974 transitions. [2022-03-15 19:02:07,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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:02:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 2974 transitions. [2022-03-15 19:02:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:07,068 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:07,068 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:07,087 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:02:07,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:07,285 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:07,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash 341339262, now seen corresponding path program 2 times [2022-03-15 19:02:07,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:07,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389782192] [2022-03-15 19:02:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:07,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:07,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389782192] [2022-03-15 19:02:07,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389782192] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:07,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854535735] [2022-03-15 19:02:07,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:02:07,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:07,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:07,589 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:02:07,590 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:02:07,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:02:07,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:07,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:02:07,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:07,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:07,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 19:02:07,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:07,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 19:02:07,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 19:02:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:07,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:08,106 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_428 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_428) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_428 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_428) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-15 19:02:08,139 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_427) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_428) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_427) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_428) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-03-15 19:02:08,169 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:08,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 77 [2022-03-15 19:02:08,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2022-03-15 19:02:08,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-03-15 19:02:08,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:08,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:08,214 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:08,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-03-15 19:02:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:08,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854535735] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:08,334 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:08,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 19:02:08,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725365894] [2022-03-15 19:02:08,334 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:08,339 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:08,404 INFO L252 McrAutomatonBuilder]: Finished intersection with 231 states and 542 transitions. [2022-03-15 19:02:08,404 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:12,754 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [26944#(and (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 1))) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= ~s_2~0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))))), 26947#(and (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (< 3 (+ ~X_0~0.offset (* ~i_3~0 4))) (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))))), 26946#(and (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) 4)) (= ~X_0~0.offset 0) (<= (select (select |#memory_int| ~X_0~0.base) 4) ~s_2~0)), 26948#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) ~s_6~0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< ~s_6~0 (+ ~s_2~0 ~t_4~0 1)))), 26945#(and (or (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 1)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))))] [2022-03-15 19:02:12,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:02:12,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:12,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:02:12,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=769, Unknown=2, NotChecked=114, Total=992 [2022-03-15 19:02:12,755 INFO L87 Difference]: Start difference. First operand 903 states and 2974 transitions. Second operand has 16 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 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:02:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:13,841 INFO L93 Difference]: Finished difference Result 2083 states and 7058 transitions. [2022-03-15 19:02:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:02:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 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 36 [2022-03-15 19:02:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:13,850 INFO L225 Difference]: With dead ends: 2083 [2022-03-15 19:02:13,850 INFO L226 Difference]: Without dead ends: 2003 [2022-03-15 19:02:13,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 216 SyntacticMatches, 17 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=1715, Unknown=2, NotChecked=174, Total=2162 [2022-03-15 19:02:13,851 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 260 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:13,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 206 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:02:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2022-03-15 19:02:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 955. [2022-03-15 19:02:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 3.3207547169811322) internal successors, (3168), 954 states have internal predecessors, (3168), 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:02:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 3168 transitions. [2022-03-15 19:02:13,879 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 3168 transitions. Word has length 36 [2022-03-15 19:02:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:13,880 INFO L470 AbstractCegarLoop]: Abstraction has 955 states and 3168 transitions. [2022-03-15 19:02:13,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 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:02:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 3168 transitions. [2022-03-15 19:02:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:13,883 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:13,883 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:13,902 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:02:14,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:14,091 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:14,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1961781948, now seen corresponding path program 3 times [2022-03-15 19:02:14,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:14,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256890126] [2022-03-15 19:02:14,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:14,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:14,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:14,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256890126] [2022-03-15 19:02:14,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256890126] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:14,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531518448] [2022-03-15 19:02:14,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:02:14,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:14,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:14,352 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:02:14,375 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:02:14,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:02:14,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:14,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:02:14,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:14,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:14,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 19:02:14,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:14,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:14,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 19:02:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:14,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:14,849 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_486 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_486) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_486 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_486) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-15 19:02:14,863 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_486 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_486) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_486 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_486) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-15 19:02:14,870 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_486 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_486) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_486 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_486) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-15 19:02:14,888 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_485) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_486) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_485) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_486) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-15 19:02:14,942 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:14,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 81 [2022-03-15 19:02:14,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-03-15 19:02:14,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-03-15 19:02:15,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:15,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:15,009 INFO L353 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2022-03-15 19:02:15,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 10 [2022-03-15 19:02:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:02:15,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531518448] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:15,124 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:15,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 19:02:15,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724652880] [2022-03-15 19:02:15,124 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:15,130 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:15,165 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 310 transitions. [2022-03-15 19:02:15,165 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:19,029 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [31219#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (= ~s_6~0 0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= ~i_7~0 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) (+ ~s_2~0 ~t_4~0))) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 31220#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) (+ ~s_2~0 ~t_4~0))) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 31214#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) ~s_6~0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< ~s_6~0 (+ ~s_2~0 ~t_4~0 1)))), 31209#(and (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 1))) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= ~s_2~0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))))), 31213#(and (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) ~s_2~0) (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))))), 31210#(and (or (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 1)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))))), 31217#(and (or (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0 1)) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0))), 31215#(and (or (<= (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 ~t_4~0 1)) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 31216#(and (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) 4)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (= ~s_6~0 0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= ~i_7~0 0)) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 31211#(and (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) 4)) (= ~X_0~0.offset 0) (<= (select (select |#memory_int| ~X_0~0.base) 4) ~s_2~0) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), 31218#(and (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) 4)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 31212#(and (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) ~s_2~0) (= ~X_0~0.offset 0) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))))] [2022-03-15 19:02:19,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:02:19,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:19,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:02:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1057, Unknown=4, NotChecked=276, Total=1482 [2022-03-15 19:02:19,030 INFO L87 Difference]: Start difference. First operand 955 states and 3168 transitions. Second operand has 23 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 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:02:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:20,650 INFO L93 Difference]: Finished difference Result 1768 states and 6037 transitions. [2022-03-15 19:02:20,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:02:20,651 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 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 36 [2022-03-15 19:02:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:20,658 INFO L225 Difference]: With dead ends: 1768 [2022-03-15 19:02:20,658 INFO L226 Difference]: Without dead ends: 1733 [2022-03-15 19:02:20,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=416, Invalid=2788, Unknown=4, NotChecked=452, Total=3660 [2022-03-15 19:02:20,659 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 329 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:20,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 247 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:02:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2022-03-15 19:02:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 943. [2022-03-15 19:02:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 3.3184713375796178) internal successors, (3126), 942 states have internal predecessors, (3126), 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:02:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 3126 transitions. [2022-03-15 19:02:20,681 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 3126 transitions. Word has length 36 [2022-03-15 19:02:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:20,681 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 3126 transitions. [2022-03-15 19:02:20,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 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:02:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 3126 transitions. [2022-03-15 19:02:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:20,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:20,683 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:20,700 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:02:20,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:20,900 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:20,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:20,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1524486198, now seen corresponding path program 1 times [2022-03-15 19:02:20,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:20,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020755123] [2022-03-15 19:02:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:20,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:21,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:21,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020755123] [2022-03-15 19:02:21,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020755123] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:21,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623026163] [2022-03-15 19:02:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:21,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:21,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:21,073 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:02:21,073 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:02:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:21,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:02:21,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:21,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:21,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 19:02:21,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:02:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:21,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:21,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_543) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) is different from false [2022-03-15 19:02:21,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 (Array Int Int))) (= (+ c_~t_5~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_543) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2022-03-15 19:02:21,437 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:21,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2022-03-15 19:02:21,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 19:02:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:02:21,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623026163] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:21,525 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:21,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 19:02:21,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1116586515] [2022-03-15 19:02:21,525 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:21,529 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:21,563 INFO L252 McrAutomatonBuilder]: Finished intersection with 159 states and 329 transitions. [2022-03-15 19:02:21,563 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:24,382 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [35157#(and (or (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (= ~X_0~0.offset 0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (select (select |#memory_int| ~X_0~0.base) 4)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 35154#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)) (<= (+ ~s_2~0 ~t_5~0) (select (select |#memory_int| ~X_0~0.base) 4))) (or (= ~X_0~0.offset 0) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)) (= ~i_7~0 0)) (or (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (= ~s_6~0 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 35153#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)) (< ~s_6~0 (+ ~s_2~0 ~t_5~0 1))) (or (<= (+ ~s_2~0 ~t_5~0) ~s_6~0) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 35155#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)) (<= (+ ~s_2~0 ~t_5~0) (select (select |#memory_int| ~X_0~0.base) 4))) (or (= ~X_0~0.offset 0) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 35156#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)) (not (= ~X_0~0.base |ULTIMATE.start_main_~#t4~0#1.base|))) (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)) (<= (+ ~s_2~0 ~t_5~0) (select (select |#memory_int| ~X_0~0.base) 4))) (or (= ~X_0~0.offset 0) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0))))] [2022-03-15 19:02:24,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:02:24,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:24,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:02:24,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=614, Unknown=2, NotChecked=102, Total=812 [2022-03-15 19:02:24,383 INFO L87 Difference]: Start difference. First operand 943 states and 3126 transitions. Second operand has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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:02:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:25,427 INFO L93 Difference]: Finished difference Result 1734 states and 5916 transitions. [2022-03-15 19:02:25,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:02:25,427 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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 36 [2022-03-15 19:02:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:25,437 INFO L225 Difference]: With dead ends: 1734 [2022-03-15 19:02:25,437 INFO L226 Difference]: Without dead ends: 1691 [2022-03-15 19:02:25,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 161 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=1765, Unknown=2, NotChecked=178, Total=2256 [2022-03-15 19:02:25,438 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 278 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:25,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 142 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:02:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-03-15 19:02:25,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1007. [2022-03-15 19:02:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.3479125248508947) internal successors, (3368), 1006 states have internal predecessors, (3368), 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:02:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3368 transitions. [2022-03-15 19:02:25,463 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3368 transitions. Word has length 36 [2022-03-15 19:02:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:25,463 INFO L470 AbstractCegarLoop]: Abstraction has 1007 states and 3368 transitions. [2022-03-15 19:02:25,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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:02:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3368 transitions. [2022-03-15 19:02:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:25,465 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:25,465 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:25,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 19:02:25,679 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,SelfDestructingSolverStorable11 [2022-03-15 19:02:25,679 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:25,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1466398744, now seen corresponding path program 4 times [2022-03-15 19:02:25,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:25,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296839911] [2022-03-15 19:02:25,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:25,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:25,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:25,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296839911] [2022-03-15 19:02:25,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296839911] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:25,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472578644] [2022-03-15 19:02:25,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:02:25,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:25,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:25,847 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:02:25,848 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:02:25,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:02:25,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:25,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:02:25,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:26,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 19:02:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:26,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:26,180 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:26,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-15 19:02:26,192 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:26,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-15 19:02:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:26,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472578644] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:26,272 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:26,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2022-03-15 19:02:26,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1451747240] [2022-03-15 19:02:26,272 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:26,276 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:26,315 INFO L252 McrAutomatonBuilder]: Finished intersection with 177 states and 401 transitions. [2022-03-15 19:02:26,316 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:29,898 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [39171#(and (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 1))) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= ~s_2~0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))))), 39177#(and (= ~X_0~0.offset 0) (= ~s_2~0 0) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)), 39172#(and (or (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 1)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))))), 39175#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) ~s_6~0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< ~s_6~0 (+ ~s_2~0 ~t_4~0 1)))), 39173#(and (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) 4)) (= ~X_0~0.offset 0) (<= (select (select |#memory_int| ~X_0~0.base) 4) ~s_2~0)), 39176#(and (or (<= (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) ~s_6~0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (< ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 39174#(and (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) ~s_2~0) (= ~X_0~0.offset 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))))] [2022-03-15 19:02:29,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:02:29,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:29,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:02:29,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:02:29,899 INFO L87 Difference]: Start difference. First operand 1007 states and 3368 transitions. Second operand has 17 states, 16 states have (on average 5.75) internal successors, (92), 16 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:02:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:30,721 INFO L93 Difference]: Finished difference Result 2388 states and 8179 transitions. [2022-03-15 19:02:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:02:30,722 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.75) internal successors, (92), 16 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 36 [2022-03-15 19:02:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:30,728 INFO L225 Difference]: With dead ends: 2388 [2022-03-15 19:02:30,728 INFO L226 Difference]: Without dead ends: 2304 [2022-03-15 19:02:30,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 191 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:02:30,729 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 284 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:30,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 224 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:02:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2022-03-15 19:02:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 1071. [2022-03-15 19:02:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 3.353271028037383) internal successors, (3588), 1070 states have internal predecessors, (3588), 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:02:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 3588 transitions. [2022-03-15 19:02:30,754 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 3588 transitions. Word has length 36 [2022-03-15 19:02:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:30,754 INFO L470 AbstractCegarLoop]: Abstraction has 1071 states and 3588 transitions. [2022-03-15 19:02:30,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.75) internal successors, (92), 16 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:02:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 3588 transitions. [2022-03-15 19:02:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:30,756 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:30,756 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:30,785 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:02:30,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:02:30,975 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash -587082962, now seen corresponding path program 2 times [2022-03-15 19:02:30,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:30,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272396618] [2022-03-15 19:02:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:31,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:31,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272396618] [2022-03-15 19:02:31,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272396618] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:31,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065599620] [2022-03-15 19:02:31,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:02:31,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:31,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:31,114 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:02:31,139 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:02:31,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:02:31,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:31,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:02:31,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:31,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:02:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:31,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:31,431 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:31,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-15 19:02:31,444 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:31,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-15 19:02:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:31,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065599620] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:31,522 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:31,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2022-03-15 19:02:31,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1771006084] [2022-03-15 19:02:31,522 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:31,526 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:31,571 INFO L252 McrAutomatonBuilder]: Finished intersection with 204 states and 488 transitions. [2022-03-15 19:02:31,571 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:36,767 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [43964#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ ~s_6~0 1)) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (<= ~s_6~0 (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 43968#(and (or (not (<= 0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648))) (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) ~t_5~0) (not (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) 2147483647))) (or (<= ~t_5~0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (not (<= 0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648))) (not (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) 2147483647))) (or (not (<= 0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648))) (= ~s_2~0 0) (not (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) 2147483647)))), 43970#(and (or (= ~s_2~0 0) (not (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648)))) (or (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~t_5~0) (not (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648)))) (or (<= ~t_5~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (not (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648))))), 43966#(and (or (< ~s_2~0 (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 1)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0))), 43965#(and (or (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) ~s_2~0) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< ~s_2~0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 1)))), 43967#(and (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 ~t_5~0))) (or (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 1)) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 43969#(and (or (< 2147483647 (+ ~s_2~0 ~t_5~0)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 1))) (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_5~0))))] [2022-03-15 19:02:36,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:02:36,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:02:36,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:02:36,768 INFO L87 Difference]: Start difference. First operand 1071 states and 3588 transitions. Second operand has 17 states, 16 states have (on average 6.1875) internal successors, (99), 16 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:02:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:37,724 INFO L93 Difference]: Finished difference Result 1925 states and 6590 transitions. [2022-03-15 19:02:37,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:02:37,724 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.1875) internal successors, (99), 16 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 36 [2022-03-15 19:02:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:37,730 INFO L225 Difference]: With dead ends: 1925 [2022-03-15 19:02:37,730 INFO L226 Difference]: Without dead ends: 1882 [2022-03-15 19:02:37,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 215 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:02:37,731 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 171 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:37,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 232 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:02:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-03-15 19:02:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1071. [2022-03-15 19:02:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 3.353271028037383) internal successors, (3588), 1070 states have internal predecessors, (3588), 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:02:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 3588 transitions. [2022-03-15 19:02:37,751 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 3588 transitions. Word has length 36 [2022-03-15 19:02:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:37,752 INFO L470 AbstractCegarLoop]: Abstraction has 1071 states and 3588 transitions. [2022-03-15 19:02:37,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.1875) internal successors, (99), 16 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:02:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 3588 transitions. [2022-03-15 19:02:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:37,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:37,754 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:37,787 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:02:37,967 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,SelfDestructingSolverStorable13 [2022-03-15 19:02:37,967 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1242914242, now seen corresponding path program 5 times [2022-03-15 19:02:37,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:37,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37374752] [2022-03-15 19:02:37,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:37,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:38,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:38,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37374752] [2022-03-15 19:02:38,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37374752] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:38,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847331719] [2022-03-15 19:02:38,237 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:02:38,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:38,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:38,238 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:02:38,250 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:02:38,354 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:02:38,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:38,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:02:38,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:38,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:38,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:38,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 19:02:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:02:38,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:38,688 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_712 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_712) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_712 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_712) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-15 19:02:38,700 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_712 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_712) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_712 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_712) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-15 19:02:38,707 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:38,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-15 19:02:38,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-15 19:02:38,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:38,729 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-15 19:02:38,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-15 19:02:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:02:38,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847331719] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:38,862 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:38,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 26 [2022-03-15 19:02:38,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640103548] [2022-03-15 19:02:38,862 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:38,866 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:38,895 INFO L252 McrAutomatonBuilder]: Finished intersection with 140 states and 291 transitions. [2022-03-15 19:02:38,895 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:42,346 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [48301#(and (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 1))) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= ~s_2~0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))))), 48300#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) ~s_6~0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< ~s_6~0 (+ ~s_2~0 ~t_4~0 1)))), 48303#(and (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) 4)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (= ~s_6~0 0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= ~i_7~0 0)) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 48305#(and (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) 4)) (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (<= (select (select |#memory_int| ~X_0~0.base) 4) ~s_2~0)), 48308#(and (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (<= (select (select |#memory_int| ~X_0~0.base) 4) ~t_4~0) (= ~s_2~0 0) (<= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) 4))), 48307#(and (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) 4)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 48306#(and (or (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0 1)) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0))), 48302#(and (or (<= (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 ~t_4~0 1)) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 48304#(and (or (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 1)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))))] [2022-03-15 19:02:42,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:02:42,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:42,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:02:42,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1065, Unknown=2, NotChecked=134, Total=1332 [2022-03-15 19:02:42,347 INFO L87 Difference]: Start difference. First operand 1071 states and 3588 transitions. Second operand has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 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:02:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:43,552 INFO L93 Difference]: Finished difference Result 2040 states and 6975 transitions. [2022-03-15 19:02:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:02:43,552 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 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 36 [2022-03-15 19:02:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:43,557 INFO L225 Difference]: With dead ends: 2040 [2022-03-15 19:02:43,557 INFO L226 Difference]: Without dead ends: 2001 [2022-03-15 19:02:43,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=2130, Unknown=2, NotChecked=194, Total=2652 [2022-03-15 19:02:43,558 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 265 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:43,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 273 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:02:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2022-03-15 19:02:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1053. [2022-03-15 19:02:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 1052 states have (on average 3.3507604562737643) internal successors, (3525), 1052 states have internal predecessors, (3525), 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:02:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 3525 transitions. [2022-03-15 19:02:43,580 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 3525 transitions. Word has length 36 [2022-03-15 19:02:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:43,580 INFO L470 AbstractCegarLoop]: Abstraction has 1053 states and 3525 transitions. [2022-03-15 19:02:43,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 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:02:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 3525 transitions. [2022-03-15 19:02:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:43,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:43,582 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:43,601 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:02:43,791 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,SelfDestructingSolverStorable14 [2022-03-15 19:02:43,791 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1733815734, now seen corresponding path program 6 times [2022-03-15 19:02:43,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:43,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344545125] [2022-03-15 19:02:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:43,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:43,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344545125] [2022-03-15 19:02:43,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344545125] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:43,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644982273] [2022-03-15 19:02:43,970 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:02:43,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:43,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:43,971 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:02:43,972 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:02:44,084 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:02:44,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:44,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 19:02:44,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:44,109 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:02:44,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-03-15 19:02:44,145 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:02:44,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 19:02:44,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:44,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:02:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:44,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:44,416 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_774 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_774) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_774 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_774) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-15 19:02:44,427 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:44,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-15 19:02:44,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-15 19:02:44,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:44,456 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:44,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-15 19:02:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:02:44,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644982273] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:44,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:44,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-03-15 19:02:44,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [207635648] [2022-03-15 19:02:44,574 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:44,578 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:44,595 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 146 transitions. [2022-03-15 19:02:44,596 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:45,742 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [52718#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= ~s_6~0 (+ ~s_2~0 ~t_4~0))) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 1)))), 52719#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))))] [2022-03-15 19:02:45,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:02:45,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:02:45,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=468, Unknown=1, NotChecked=44, Total=600 [2022-03-15 19:02:45,743 INFO L87 Difference]: Start difference. First operand 1053 states and 3525 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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:02:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:46,062 INFO L93 Difference]: Finished difference Result 1388 states and 4710 transitions. [2022-03-15 19:02:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:02:46,062 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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 36 [2022-03-15 19:02:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:46,065 INFO L225 Difference]: With dead ends: 1388 [2022-03-15 19:02:46,065 INFO L226 Difference]: Without dead ends: 1349 [2022-03-15 19:02:46,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=733, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:02:46,066 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 140 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:46,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 94 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:02:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-03-15 19:02:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1065. [2022-03-15 19:02:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1064 states have (on average 3.356203007518797) internal successors, (3571), 1064 states have internal predecessors, (3571), 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:02:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 3571 transitions. [2022-03-15 19:02:46,095 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 3571 transitions. Word has length 36 [2022-03-15 19:02:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:46,095 INFO L470 AbstractCegarLoop]: Abstraction has 1065 states and 3571 transitions. [2022-03-15 19:02:46,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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:02:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 3571 transitions. [2022-03-15 19:02:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:46,097 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:46,097 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:46,127 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:02:46,323 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,SelfDestructingSolverStorable15 [2022-03-15 19:02:46,323 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash 93078744, now seen corresponding path program 3 times [2022-03-15 19:02:46,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:46,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875356929] [2022-03-15 19:02:46,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:46,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:46,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875356929] [2022-03-15 19:02:46,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875356929] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:46,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857247579] [2022-03-15 19:02:46,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:02:46,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:46,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:46,487 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:02:46,488 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:02:46,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:02:46,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:46,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 19:02:46,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:46,623 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:02:46,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-03-15 19:02:46,661 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:02:46,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 19:02:46,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:46,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:02:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:46,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:46,937 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_835 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_835) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_835 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_835) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-15 19:02:46,949 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:46,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-15 19:02:46,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-15 19:02:46,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:46,973 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:46,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-15 19:02:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:02:47,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857247579] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:47,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:47,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-03-15 19:02:47,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119397921] [2022-03-15 19:02:47,109 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:47,113 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:47,149 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 146 transitions. [2022-03-15 19:02:47,149 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:48,348 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [56483#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ ~s_6~0 1)) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (<= ~s_6~0 (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 56484#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))))] [2022-03-15 19:02:48,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:02:48,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:48,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:02:48,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=468, Unknown=1, NotChecked=44, Total=600 [2022-03-15 19:02:48,349 INFO L87 Difference]: Start difference. First operand 1065 states and 3571 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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:02:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:48,696 INFO L93 Difference]: Finished difference Result 1338 states and 4541 transitions. [2022-03-15 19:02:48,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:02:48,696 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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 36 [2022-03-15 19:02:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:48,699 INFO L225 Difference]: With dead ends: 1338 [2022-03-15 19:02:48,699 INFO L226 Difference]: Without dead ends: 1295 [2022-03-15 19:02:48,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=733, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:02:48,700 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 146 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:48,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 83 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:02:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-03-15 19:02:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1053. [2022-03-15 19:02:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 1052 states have (on average 3.3507604562737643) internal successors, (3525), 1052 states have internal predecessors, (3525), 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:02:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 3525 transitions. [2022-03-15 19:02:48,716 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 3525 transitions. Word has length 36 [2022-03-15 19:02:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:48,717 INFO L470 AbstractCegarLoop]: Abstraction has 1053 states and 3525 transitions. [2022-03-15 19:02:48,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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:02:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 3525 transitions. [2022-03-15 19:02:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:48,719 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:48,719 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:48,739 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:02:48,931 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,SelfDestructingSolverStorable16 [2022-03-15 19:02:48,931 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2128680666, now seen corresponding path program 7 times [2022-03-15 19:02:48,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:48,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958691488] [2022-03-15 19:02:48,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:49,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:49,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958691488] [2022-03-15 19:02:49,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958691488] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:49,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870536621] [2022-03-15 19:02:49,186 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:02:49,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:49,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:49,188 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:02:49,215 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:02:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:49,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:02:49,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:49,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:49,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:49,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:02:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:49,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:49,645 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_892 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_892) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_892 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_892) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-15 19:02:49,653 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:49,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-15 19:02:49,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-15 19:02:49,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:49,679 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:49,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-15 19:02:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:49,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870536621] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:49,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:49,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2022-03-15 19:02:49,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [806241279] [2022-03-15 19:02:49,794 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:49,798 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:49,817 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 184 transitions. [2022-03-15 19:02:49,818 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:51,179 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [60176#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= ~s_6~0 (+ ~s_2~0 ~t_4~0))) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 1)))), 60177#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))))] [2022-03-15 19:02:51,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:02:51,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:51,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:02:51,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=567, Unknown=1, NotChecked=48, Total=702 [2022-03-15 19:02:51,180 INFO L87 Difference]: Start difference. First operand 1053 states and 3525 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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:02:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:51,891 INFO L93 Difference]: Finished difference Result 2456 states and 8358 transitions. [2022-03-15 19:02:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:02:51,891 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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 36 [2022-03-15 19:02:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:51,897 INFO L225 Difference]: With dead ends: 2456 [2022-03-15 19:02:51,897 INFO L226 Difference]: Without dead ends: 2411 [2022-03-15 19:02:51,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=967, Unknown=1, NotChecked=64, Total=1190 [2022-03-15 19:02:51,898 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 151 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:51,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 150 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:02:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2022-03-15 19:02:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 1101. [2022-03-15 19:02:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1100 states have (on average 3.3172727272727274) internal successors, (3649), 1100 states have internal predecessors, (3649), 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:02:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 3649 transitions. [2022-03-15 19:02:51,921 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 3649 transitions. Word has length 36 [2022-03-15 19:02:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:51,922 INFO L470 AbstractCegarLoop]: Abstraction has 1101 states and 3649 transitions. [2022-03-15 19:02:51,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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:02:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 3649 transitions. [2022-03-15 19:02:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:51,923 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:51,924 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:51,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:52,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:52,140 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1409636218, now seen corresponding path program 8 times [2022-03-15 19:02:52,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:52,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523382137] [2022-03-15 19:02:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:52,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:52,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523382137] [2022-03-15 19:02:52,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523382137] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:52,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870283076] [2022-03-15 19:02:52,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:02:52,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:52,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:52,396 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:02:52,397 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:02:52,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:02:52,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:52,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 19:02:52,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:52,532 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:02:52,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-03-15 19:02:52,626 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:02:52,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 19:02:52,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:02:52,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:52,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:52,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:02:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:52,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:52,983 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_955 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_955) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_955 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_955) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-15 19:02:53,007 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_954 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_954) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_955) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_954 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_954) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_955) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-15 19:02:53,015 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:53,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 186 [2022-03-15 19:02:53,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2022-03-15 19:02:53,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 126 [2022-03-15 19:02:53,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:53,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:53,100 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-15 19:02:53,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-03-15 19:02:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 19:02:53,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870283076] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:53,414 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:53,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:02:53,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [21820782] [2022-03-15 19:02:53,414 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:53,418 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:53,435 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 154 transitions. [2022-03-15 19:02:53,435 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:54,685 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [65094#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= ~s_6~0 (+ ~s_2~0 ~t_4~0))) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 1)))), 65095#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))))] [2022-03-15 19:02:54,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:02:54,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:54,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:02:54,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=870, Unknown=2, NotChecked=122, Total=1122 [2022-03-15 19:02:54,686 INFO L87 Difference]: Start difference. First operand 1101 states and 3649 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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:02:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:55,154 INFO L93 Difference]: Finished difference Result 1488 states and 5012 transitions. [2022-03-15 19:02:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:02:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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 36 [2022-03-15 19:02:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:55,168 INFO L225 Difference]: With dead ends: 1488 [2022-03-15 19:02:55,168 INFO L226 Difference]: Without dead ends: 1443 [2022-03-15 19:02:55,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1200, Unknown=2, NotChecked=146, Total=1560 [2022-03-15 19:02:55,169 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 138 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:55,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 117 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:02:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-03-15 19:02:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1089. [2022-03-15 19:02:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1088 states have (on average 3.348345588235294) internal successors, (3643), 1088 states have internal predecessors, (3643), 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:02:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 3643 transitions. [2022-03-15 19:02:55,187 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 3643 transitions. Word has length 36 [2022-03-15 19:02:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:55,188 INFO L470 AbstractCegarLoop]: Abstraction has 1089 states and 3643 transitions. [2022-03-15 19:02:55,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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:02:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 3643 transitions. [2022-03-15 19:02:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:55,189 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:55,190 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:55,207 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:02:55,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:55,407 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash 417258260, now seen corresponding path program 4 times [2022-03-15 19:02:55,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:55,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138886646] [2022-03-15 19:02:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:55,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:55,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138886646] [2022-03-15 19:02:55,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138886646] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:55,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339413055] [2022-03-15 19:02:55,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:02:55,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:55,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:55,595 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:02:55,595 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:02:55,705 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:02:55,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:55,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 19:02:55,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:55,725 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:02:55,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-03-15 19:02:55,766 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 19:02:55,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:55,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:55,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:02:55,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:02:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:56,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:56,145 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1017) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1017 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1017) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-15 19:02:56,167 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1016) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1017) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1016) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1017) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-15 19:02:56,177 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:56,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 97 [2022-03-15 19:02:56,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-03-15 19:02:56,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-03-15 19:02:56,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:56,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:02:56,227 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:56,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-15 19:02:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:02:56,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339413055] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:56,455 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:56,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 19:02:56,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1324758158] [2022-03-15 19:02:56,456 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:56,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:56,478 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 154 transitions. [2022-03-15 19:02:56,478 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:57,802 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [69011#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 69010#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ ~s_6~0 1)) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (<= ~s_6~0 (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0))))] [2022-03-15 19:02:57,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:02:57,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:02:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=557, Unknown=2, NotChecked=98, Total=756 [2022-03-15 19:02:57,803 INFO L87 Difference]: Start difference. First operand 1089 states and 3643 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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:02:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:58,164 INFO L93 Difference]: Finished difference Result 1354 states and 4593 transitions. [2022-03-15 19:02:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:02:58,164 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 36 [2022-03-15 19:02:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:58,168 INFO L225 Difference]: With dead ends: 1354 [2022-03-15 19:02:58,168 INFO L226 Difference]: Without dead ends: 1311 [2022-03-15 19:02:58,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=847, Unknown=2, NotChecked=122, Total=1122 [2022-03-15 19:02:58,168 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 132 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:58,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 108 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:02:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2022-03-15 19:02:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1061. [2022-03-15 19:02:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 3.3443396226415096) internal successors, (3545), 1060 states have internal predecessors, (3545), 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:02:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 3545 transitions. [2022-03-15 19:02:58,185 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 3545 transitions. Word has length 36 [2022-03-15 19:02:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:58,186 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 3545 transitions. [2022-03-15 19:02:58,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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:02:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 3545 transitions. [2022-03-15 19:02:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:02:58,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:58,188 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:58,217 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:02:58,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:58,405 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:02:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1273686664, now seen corresponding path program 9 times [2022-03-15 19:02:58,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:58,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860439850] [2022-03-15 19:02:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:58,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:58,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860439850] [2022-03-15 19:02:58,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860439850] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:58,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518042379] [2022-03-15 19:02:58,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:02:58,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:58,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:58,527 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:02:58,529 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:02:58,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:02:58,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:58,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:02:58,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:58,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 19:02:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:58,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:58,904 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:58,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-15 19:02:58,919 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:02:58,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-03-15 19:02:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:02:58,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518042379] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:58,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:58,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2022-03-15 19:02:58,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950633800] [2022-03-15 19:02:58,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:58,975 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:59,003 INFO L252 McrAutomatonBuilder]: Finished intersection with 131 states and 262 transitions. [2022-03-15 19:02:59,003 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:01,293 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [72727#(and (or (<= (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) ~s_6~0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (< ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 72730#(and (or (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0))), 72735#(and (= ~X_0~0.offset 0) (= ~s_2~0 0) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)), 72726#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) ~s_6~0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< ~s_6~0 (+ ~s_2~0 ~t_4~0 1)))), 72729#(and (or (<= (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 ~t_4~0 1)) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 72736#(and (= ~X_0~0.offset 0) (= ~i_3~0 0) (= ~s_2~0 0)), 72732#(and (or (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0 1)) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0))), 72733#(and (or (<= (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0)) (or (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))))), 72728#(and (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 1))) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= ~s_2~0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))))), 72731#(and (or (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 1)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))))), 72734#(and (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) ~s_2~0) (= ~X_0~0.offset 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))))] [2022-03-15 19:03:01,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:03:01,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:03:01,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:03:01,294 INFO L87 Difference]: Start difference. First operand 1061 states and 3545 transitions. Second operand has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 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:03:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:03,226 INFO L93 Difference]: Finished difference Result 3111 states and 10659 transitions. [2022-03-15 19:03:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:03:03,227 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 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 36 [2022-03-15 19:03:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:03,232 INFO L225 Difference]: With dead ends: 3111 [2022-03-15 19:03:03,232 INFO L226 Difference]: Without dead ends: 2976 [2022-03-15 19:03:03,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=367, Invalid=2389, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:03:03,233 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 362 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 2879 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:03,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 436 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2879 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:03:03,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2022-03-15 19:03:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1271. [2022-03-15 19:03:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 3.514173228346457) internal successors, (4463), 1270 states have internal predecessors, (4463), 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:03:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 4463 transitions. [2022-03-15 19:03:03,262 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 4463 transitions. Word has length 36 [2022-03-15 19:03:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:03,262 INFO L470 AbstractCegarLoop]: Abstraction has 1271 states and 4463 transitions. [2022-03-15 19:03:03,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 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:03:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 4463 transitions. [2022-03-15 19:03:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:03:03,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:03,264 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:03,283 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:03:03,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:03,476 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 658338782, now seen corresponding path program 10 times [2022-03-15 19:03:03,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:03,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156116549] [2022-03-15 19:03:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:03,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:03,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156116549] [2022-03-15 19:03:03,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156116549] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:03,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667226518] [2022-03-15 19:03:03,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:03:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:03,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:03,675 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:03:03,676 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:03:03,789 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:03:03,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:03,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 19:03:03,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:03,809 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:03:03,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-03-15 19:03:03,877 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:03:03,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 19:03:03,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:04,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-03-15 19:03:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:04,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:04,136 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1135 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1135) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_1135 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1135) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-15 19:03:04,157 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1135 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1135) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_1135 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1135) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-03-15 19:03:04,164 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:04,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-15 19:03:04,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-15 19:03:04,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:03:04,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:04,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-15 19:03:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:03:04,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667226518] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:04,319 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:04,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-03-15 19:03:04,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849461986] [2022-03-15 19:03:04,320 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:04,323 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:04,354 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 330 transitions. [2022-03-15 19:03:04,355 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:08,588 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [78693#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (<= ~s_2~0 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (= ~X_0~0.offset 0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (= (+ ~X_0~0.offset (* ~i_3~0 4)) 0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= 0 ~s_2~0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 78687#(and (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) ~s_2~0) (= ~X_0~0.offset 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))))), 78695#(and (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (= ~i_3~0 0) (= ~s_2~0 0)), 78688#(and (or (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0 1)) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0))), 78685#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (<= ~s_2~0 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (= ~X_0~0.offset 0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (= ~s_6~0 0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (= ~i_7~0 0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (= (+ ~X_0~0.offset (* ~i_3~0 4)) 0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= 0 ~s_2~0) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 78678#(and (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 1))) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= ~s_2~0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))))), 78683#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (= ~s_6~0 0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= ~i_7~0 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) (+ ~s_2~0 ~t_4~0))) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 78689#(and (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) ~s_2~0) (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))))), 78691#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) (+ ~s_2~0 ~t_4~0))) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 78681#(and (or (<= (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 ~t_4~0 1)) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 78686#(and (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) 4)) (= ~X_0~0.offset 0) (<= (select (select |#memory_int| ~X_0~0.base) 4) ~s_2~0)), 78682#(and (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) 4)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (= ~s_6~0 0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= ~i_7~0 0)) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 78690#(and (or (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) 4)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 78679#(and (or (< (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 1)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (<= ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))))), 78684#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (= ~s_6~0 0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= ~i_7~0 0)) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) (+ ~s_2~0 ~t_4~0))) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 78692#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4))) (+ ~s_2~0 ~t_4~0))) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0))), 78680#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (<= (+ ~s_2~0 ~t_4~0) ~s_6~0) (< (+ ~s_2~0 ~t_4~0 2147483648) 0)) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< ~s_6~0 (+ ~s_2~0 ~t_4~0 1)))), 78694#(and (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (= ~s_2~0 0) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4))] [2022-03-15 19:03:08,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:03:08,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:03:08,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1548, Unknown=2, NotChecked=162, Total=1892 [2022-03-15 19:03:08,592 INFO L87 Difference]: Start difference. First operand 1271 states and 4463 transitions. Second operand has 29 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 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:03:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:09,980 INFO L93 Difference]: Finished difference Result 2396 states and 8361 transitions. [2022-03-15 19:03:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:03:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 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 36 [2022-03-15 19:03:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:09,985 INFO L225 Difference]: With dead ends: 2396 [2022-03-15 19:03:09,985 INFO L226 Difference]: Without dead ends: 2357 [2022-03-15 19:03:09,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=444, Invalid=3594, Unknown=2, NotChecked=250, Total=4290 [2022-03-15 19:03:09,987 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 421 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:09,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 248 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:03:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2022-03-15 19:03:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1253. [2022-03-15 19:03:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 3.5143769968051117) internal successors, (4400), 1252 states have internal predecessors, (4400), 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:03:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 4400 transitions. [2022-03-15 19:03:10,012 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 4400 transitions. Word has length 36 [2022-03-15 19:03:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:10,013 INFO L470 AbstractCegarLoop]: Abstraction has 1253 states and 4400 transitions. [2022-03-15 19:03:10,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 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:03:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 4400 transitions. [2022-03-15 19:03:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:03:10,015 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:10,015 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:10,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 19:03:10,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:10,227 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:10,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:10,227 INFO L85 PathProgramCache]: Analyzing trace with hash -127650358, now seen corresponding path program 11 times [2022-03-15 19:03:10,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:10,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853829981] [2022-03-15 19:03:10,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:10,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:10,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853829981] [2022-03-15 19:03:10,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853829981] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:10,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930193143] [2022-03-15 19:03:10,397 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:03:10,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:10,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:10,398 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:03:10,401 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:03:10,525 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:03:10,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:10,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 19:03:10,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:10,546 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:03:10,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-03-15 19:03:10,627 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 19:03:10,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-03-15 19:03:10,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:10,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:03:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:10,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:10,916 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 c_~i_3~0) (and (forall ((v_ArrVal_1196 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1196) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1196 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1196) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))))) is different from false [2022-03-15 19:03:10,943 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:10,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-15 19:03:10,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-15 19:03:10,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:03:10,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:10,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-03-15 19:03:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:03:11,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930193143] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:11,161 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:11,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-03-15 19:03:11,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280803206] [2022-03-15 19:03:11,162 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:11,165 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:11,186 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 184 transitions. [2022-03-15 19:03:11,186 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:12,755 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [83879#(and (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (select (select |#memory_int| ~X_0~0.base) 4))) (or (= ~i_3~0 0) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (= ~s_2~0 0)) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0))), 83880#(and (or (= ~X_0~0.offset 0) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (= ~s_2~0 0) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (= ~i_3~0 0) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))))), 83878#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 83881#(and (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (= ~i_3~0 0) (= ~s_2~0 0)), 83877#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= ~s_6~0 (+ ~s_2~0 ~t_4~0))) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 1))))] [2022-03-15 19:03:12,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:03:12,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:12,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:03:12,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=718, Unknown=1, NotChecked=54, Total=870 [2022-03-15 19:03:12,756 INFO L87 Difference]: Start difference. First operand 1253 states and 4400 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 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:03:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:13,250 INFO L93 Difference]: Finished difference Result 1690 states and 5925 transitions. [2022-03-15 19:03:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:03:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 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 36 [2022-03-15 19:03:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:13,255 INFO L225 Difference]: With dead ends: 1690 [2022-03-15 19:03:13,255 INFO L226 Difference]: Without dead ends: 1651 [2022-03-15 19:03:13,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=1168, Unknown=1, NotChecked=70, Total=1406 [2022-03-15 19:03:13,255 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 188 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:13,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 155 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:03:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2022-03-15 19:03:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1253. [2022-03-15 19:03:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 3.5143769968051117) internal successors, (4400), 1252 states have internal predecessors, (4400), 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:03:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 4400 transitions. [2022-03-15 19:03:13,275 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 4400 transitions. Word has length 36 [2022-03-15 19:03:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:13,275 INFO L470 AbstractCegarLoop]: Abstraction has 1253 states and 4400 transitions. [2022-03-15 19:03:13,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 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:03:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 4400 transitions. [2022-03-15 19:03:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:03:13,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:13,277 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:13,294 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:03:13,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:13,491 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:13,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1699244120, now seen corresponding path program 5 times [2022-03-15 19:03:13,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:13,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266567327] [2022-03-15 19:03:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:13,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:13,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266567327] [2022-03-15 19:03:13,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266567327] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:13,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105962152] [2022-03-15 19:03:13,646 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:03:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:13,647 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:03:13,648 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:03:13,771 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:03:13,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:13,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 19:03:13,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:13,793 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:03:13,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-03-15 19:03:13,862 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:03:13,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 19:03:13,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:13,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:03:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:14,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:14,118 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1258 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1258) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1258 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1258) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-15 19:03:14,138 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:14,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2022-03-15 19:03:14,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-03-15 19:03:14,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:03:14,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:14,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-03-15 19:03:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:03:14,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105962152] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:14,328 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:14,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-03-15 19:03:14,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512705659] [2022-03-15 19:03:14,328 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:14,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:14,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 184 transitions. [2022-03-15 19:03:14,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:15,982 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [88330#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 88333#(and (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (= ~i_3~0 0) (= ~s_2~0 0)), 88331#(and (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (select (select |#memory_int| ~X_0~0.base) 4))) (or (= ~i_3~0 0) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (<= (select (select |#memory_int| ~X_0~0.base) 4) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (= ~s_2~0 0)) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0))), 88329#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ ~s_6~0 1)) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (<= ~s_6~0 (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 88332#(and (or (= ~X_0~0.offset 0) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (= ~s_2~0 0) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (= ~i_3~0 0) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))))] [2022-03-15 19:03:15,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:03:15,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:15,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:03:15,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=712, Unknown=1, NotChecked=54, Total=870 [2022-03-15 19:03:15,983 INFO L87 Difference]: Start difference. First operand 1253 states and 4400 transitions. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 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:03:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:16,472 INFO L93 Difference]: Finished difference Result 1628 states and 5710 transitions. [2022-03-15 19:03:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:03:16,472 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 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 36 [2022-03-15 19:03:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:16,475 INFO L225 Difference]: With dead ends: 1628 [2022-03-15 19:03:16,475 INFO L226 Difference]: Without dead ends: 1585 [2022-03-15 19:03:16,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=1160, Unknown=1, NotChecked=70, Total=1406 [2022-03-15 19:03:16,476 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 177 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:16,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 152 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:03:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2022-03-15 19:03:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1225. [2022-03-15 19:03:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1224 states have (on average 3.514705882352941) internal successors, (4302), 1224 states have internal predecessors, (4302), 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:03:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 4302 transitions. [2022-03-15 19:03:16,494 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 4302 transitions. Word has length 36 [2022-03-15 19:03:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:16,495 INFO L470 AbstractCegarLoop]: Abstraction has 1225 states and 4302 transitions. [2022-03-15 19:03:16,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 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:03:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 4302 transitions. [2022-03-15 19:03:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:03:16,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:16,497 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:16,523 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:03:16,711 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,SelfDestructingSolverStorable23 [2022-03-15 19:03:16,711 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:16,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:16,712 INFO L85 PathProgramCache]: Analyzing trace with hash 992395096, now seen corresponding path program 6 times [2022-03-15 19:03:16,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:16,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289239844] [2022-03-15 19:03:16,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:16,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:16,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:16,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289239844] [2022-03-15 19:03:16,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289239844] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:16,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291759469] [2022-03-15 19:03:16,813 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:03:16,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:16,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:16,815 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:03:16,815 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:03:16,940 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:03:16,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:16,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-15 19:03:16,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:16,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:16,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:16,959 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 19:03:16,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-03-15 19:03:16,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 19:03:17,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:03:17,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:03:17,076 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 19:03:17,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:17,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:03:17,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:03:17,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:03:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:17,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:17,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291759469] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:17,577 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:17,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 8] total 24 [2022-03-15 19:03:17,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65342743] [2022-03-15 19:03:17,577 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:17,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:17,612 INFO L252 McrAutomatonBuilder]: Finished intersection with 151 states and 316 transitions. [2022-03-15 19:03:17,612 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:21,256 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [92671#(and (= ~X_0~0.offset 0) (= ~s_2~0 0) (= ~t_5~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 4)), 92668#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 92670#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 1)) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0))), 92673#(and (<= ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (= ~s_2~0 0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) ~s_6~0)), 92666#(and (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 ~t_5~0))) (or (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 1)) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 92663#(and (or (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) ~s_2~0) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< ~s_2~0 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 1)))), 92664#(and (or (< ~s_2~0 (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 1)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0))), 92667#(and (or (< 2147483647 (+ ~s_2~0 ~t_5~0)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 1))) (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_5~0)))), 92665#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ ~s_6~0 1)) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (<= ~s_6~0 (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 92669#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 1)) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4))) (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0))), 92672#(and (= ~X_0~0.offset 0) (= ~i_3~0 0) (= ~s_2~0 0))] [2022-03-15 19:03:21,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:03:21,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:21,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:03:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1116, Unknown=9, NotChecked=0, Total=1260 [2022-03-15 19:03:21,257 INFO L87 Difference]: Start difference. First operand 1225 states and 4302 transitions. Second operand has 20 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 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:03:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:22,526 INFO L93 Difference]: Finished difference Result 2149 states and 7516 transitions. [2022-03-15 19:03:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:03:22,526 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 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 36 [2022-03-15 19:03:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:22,530 INFO L225 Difference]: With dead ends: 2149 [2022-03-15 19:03:22,531 INFO L226 Difference]: Without dead ends: 2106 [2022-03-15 19:03:22,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 152 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=308, Invalid=2439, Unknown=9, NotChecked=0, Total=2756 [2022-03-15 19:03:22,532 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 239 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:22,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 283 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:03:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2022-03-15 19:03:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1211. [2022-03-15 19:03:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1210 states have (on average 3.5148760330578512) internal successors, (4253), 1210 states have internal predecessors, (4253), 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:03:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 4253 transitions. [2022-03-15 19:03:22,553 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 4253 transitions. Word has length 36 [2022-03-15 19:03:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:22,553 INFO L470 AbstractCegarLoop]: Abstraction has 1211 states and 4253 transitions. [2022-03-15 19:03:22,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 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:03:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 4253 transitions. [2022-03-15 19:03:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:03:22,564 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:22,564 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:22,583 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:03:22,781 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,SelfDestructingSolverStorable24 [2022-03-15 19:03:22,781 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:22,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2082679322, now seen corresponding path program 12 times [2022-03-15 19:03:22,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:22,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937040418] [2022-03-15 19:03:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:22,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:22,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:22,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937040418] [2022-03-15 19:03:22,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937040418] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:22,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130328802] [2022-03-15 19:03:22,956 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:03:22,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:22,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:22,958 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:03:22,959 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:03:23,098 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:03:23,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:23,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:03:23,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:23,119 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:03:23,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-03-15 19:03:23,182 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:03:23,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 19:03:23,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:23,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:03:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:23,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:23,432 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1384 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1384 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-15 19:03:23,447 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:23,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2022-03-15 19:03:23,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-03-15 19:03:23,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:03:23,484 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:23,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-03-15 19:03:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:23,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130328802] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:23,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:23,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 19:03:23,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [172141619] [2022-03-15 19:03:23,589 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:23,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:23,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 226 transitions. [2022-03-15 19:03:23,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:25,114 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:03:25,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2022-03-15 19:03:25,408 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [97514#(and (= ~X_0~0.offset 0) (not (= |thread1Thread1of1ForFork3_~#t2~0.base| ~X_0~0.base)) (= ~i_3~0 0) (= ~s_2~0 0)), 97515#(and (= ~X_0~0.offset 0) (<= ~i_7~0 1) (or (not (< |#StackHeapBarrier| ~X_0~0.base)) (= ~X_0~0.base 0)) (<= 1 ~i_7~0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4))) ~s_6~0) (<= ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4))))), 97516#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 97513#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= ~s_6~0 (+ ~s_2~0 ~t_4~0))) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 1))))] [2022-03-15 19:03:25,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:03:25,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:25,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:03:25,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=615, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:03:25,409 INFO L87 Difference]: Start difference. First operand 1211 states and 4253 transitions. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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:03:26,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:26,101 INFO L93 Difference]: Finished difference Result 2072 states and 7283 transitions. [2022-03-15 19:03:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:03:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 36 [2022-03-15 19:03:26,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:26,105 INFO L225 Difference]: With dead ends: 2072 [2022-03-15 19:03:26,105 INFO L226 Difference]: Without dead ends: 2027 [2022-03-15 19:03:26,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=1223, Unknown=1, NotChecked=72, Total=1482 [2022-03-15 19:03:26,106 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 205 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:26,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 185 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:03:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2022-03-15 19:03:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1239. [2022-03-15 19:03:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 3.501615508885299) internal successors, (4335), 1238 states have internal predecessors, (4335), 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:03:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 4335 transitions. [2022-03-15 19:03:26,127 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 4335 transitions. Word has length 36 [2022-03-15 19:03:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:26,127 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 4335 transitions. [2022-03-15 19:03:26,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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:03:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 4335 transitions. [2022-03-15 19:03:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:03:26,129 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:26,129 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:26,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 19:03:26,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 19:03:26,329 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1455637562, now seen corresponding path program 13 times [2022-03-15 19:03:26,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:26,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194330229] [2022-03-15 19:03:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:26,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:26,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:26,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194330229] [2022-03-15 19:03:26,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194330229] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:26,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129092885] [2022-03-15 19:03:26,522 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:03:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:26,523 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:03:26,524 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:03:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:26,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:03:26,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:26,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:26,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:26,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:26,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:26,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:03:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:26,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:27,003 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1442 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1442) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1442 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1442) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-15 19:03:27,029 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1442 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1441) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1442) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1442 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1441) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1442) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-15 19:03:27,037 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:27,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 97 [2022-03-15 19:03:27,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-03-15 19:03:27,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-03-15 19:03:27,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:03:27,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:03:27,119 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-15 19:03:27,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-03-15 19:03:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:03:27,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129092885] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:27,233 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:27,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 19:03:27,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801834727] [2022-03-15 19:03:27,233 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:27,237 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:27,258 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 196 transitions. [2022-03-15 19:03:27,259 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:28,902 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:03:28,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2022-03-15 19:03:29,080 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [102327#(and (= ~X_0~0.offset 0) (<= ~i_7~0 1) (<= 1 ~i_7~0) (<= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4))) ~s_6~0) (<= ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4)))) (or (= ~X_0~0.base 0) (<= ~X_0~0.base |#StackHeapBarrier|))), 102324#(and (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (<= ~s_6~0 (+ ~s_2~0 ~t_4~0))) (or (< 2147483647 (+ ~s_2~0 ~t_4~0)) (< (+ ~s_2~0 ~t_4~0 2147483648) 0) (< (+ ~s_2~0 ~t_4~0) (+ ~s_6~0 1)))), 102325#(and (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (not (= |thread1Thread1of1ForFork3_~#t2~0.base| ~X_0~0.base)) (= ~i_3~0 0) (= ~s_2~0 0)), 102326#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))))] [2022-03-15 19:03:29,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:03:29,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:29,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:03:29,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=607, Unknown=2, NotChecked=102, Total=812 [2022-03-15 19:03:29,081 INFO L87 Difference]: Start difference. First operand 1239 states and 4335 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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:03:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:29,847 INFO L93 Difference]: Finished difference Result 2018 states and 7086 transitions. [2022-03-15 19:03:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:03:29,847 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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 36 [2022-03-15 19:03:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:29,851 INFO L225 Difference]: With dead ends: 2018 [2022-03-15 19:03:29,851 INFO L226 Difference]: Without dead ends: 1979 [2022-03-15 19:03:29,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=1178, Unknown=2, NotChecked=146, Total=1560 [2022-03-15 19:03:29,852 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 215 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:29,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 187 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:03:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2022-03-15 19:03:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1251. [2022-03-15 19:03:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 3.5048) internal successors, (4381), 1250 states have internal predecessors, (4381), 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:03:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 4381 transitions. [2022-03-15 19:03:29,872 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 4381 transitions. Word has length 36 [2022-03-15 19:03:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:29,872 INFO L470 AbstractCegarLoop]: Abstraction has 1251 states and 4381 transitions. [2022-03-15 19:03:29,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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:03:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 4381 transitions. [2022-03-15 19:03:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:03:29,874 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:29,875 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:29,891 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:03:30,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:30,076 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash 371256916, now seen corresponding path program 7 times [2022-03-15 19:03:30,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:30,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665268140] [2022-03-15 19:03:30,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:30,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:30,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665268140] [2022-03-15 19:03:30,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665268140] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:30,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363023949] [2022-03-15 19:03:30,280 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:03:30,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:30,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:30,284 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:03:30,285 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:03:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:30,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:03:30,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:30,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:30,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:30,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:30,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:30,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:03:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:30,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:30,748 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1500 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1500) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1500 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1500) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-15 19:03:30,771 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1499 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1499) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1500) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1499 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1499) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1500) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-15 19:03:30,779 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:30,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 101 [2022-03-15 19:03:30,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2022-03-15 19:03:30,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2022-03-15 19:03:30,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:03:30,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:03:30,877 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-03-15 19:03:30,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-03-15 19:03:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:03:30,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363023949] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:30,979 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:30,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 19:03:30,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2134092486] [2022-03-15 19:03:30,979 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:30,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:31,004 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 196 transitions. [2022-03-15 19:03:31,004 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:33,721 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [107107#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 107106#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ ~s_6~0 1)) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (<= ~s_6~0 (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0)))), 107108#(and (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (= ~X_0~0.offset 0) (not (= |thread1Thread1of1ForFork3_~#t2~0.base| ~X_0~0.base)) (= ~i_3~0 0) (= ~s_2~0 0))] [2022-03-15 19:03:33,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:03:33,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:03:33,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=605, Unknown=2, NotChecked=102, Total=812 [2022-03-15 19:03:33,722 INFO L87 Difference]: Start difference. First operand 1251 states and 4381 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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:03:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:34,222 INFO L93 Difference]: Finished difference Result 1608 states and 5629 transitions. [2022-03-15 19:03:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:03:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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 36 [2022-03-15 19:03:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:34,226 INFO L225 Difference]: With dead ends: 1608 [2022-03-15 19:03:34,226 INFO L226 Difference]: Without dead ends: 1565 [2022-03-15 19:03:34,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=989, Unknown=2, NotChecked=134, Total=1332 [2022-03-15 19:03:34,227 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 156 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:34,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 138 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:03:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-03-15 19:03:34,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1247. [2022-03-15 19:03:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1246 states have (on average 3.5080256821829856) internal successors, (4371), 1246 states have internal predecessors, (4371), 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:03:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 4371 transitions. [2022-03-15 19:03:34,244 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 4371 transitions. Word has length 36 [2022-03-15 19:03:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:34,245 INFO L470 AbstractCegarLoop]: Abstraction has 1247 states and 4371 transitions. [2022-03-15 19:03:34,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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:03:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 4371 transitions. [2022-03-15 19:03:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:03:34,247 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:34,247 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:34,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:34,447 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,SelfDestructingSolverStorable27 [2022-03-15 19:03:34,447 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash 616772568, now seen corresponding path program 8 times [2022-03-15 19:03:34,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:34,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963724598] [2022-03-15 19:03:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:34,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:34,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:34,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963724598] [2022-03-15 19:03:34,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963724598] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:34,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024618258] [2022-03-15 19:03:34,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:03:34,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:34,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:34,631 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:03:34,631 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:03:34,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:03:34,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:34,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 19:03:34,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:34,795 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:03:34,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-03-15 19:03:34,900 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:03:34,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 19:03:34,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:34,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:34,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:35,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:03:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:35,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:35,150 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1561 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1561) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_1561 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1561) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-15 19:03:35,181 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1560) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1561) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1560) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1561) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-15 19:03:35,298 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:35,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 331 treesize of output 221 [2022-03-15 19:03:35,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 197 [2022-03-15 19:03:35,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 193 [2022-03-15 19:03:35,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 185 [2022-03-15 19:03:35,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 169 [2022-03-15 19:03:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:03:35,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024618258] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:35,621 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:35,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 19:03:35,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526670550] [2022-03-15 19:03:35,621 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:35,625 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:35,648 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 196 transitions. [2022-03-15 19:03:35,649 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:38,028 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [111466#(and (or (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))) (+ ~s_6~0 1)) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4))))) (or (<= ~s_6~0 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))) (< (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)) 2147483648) 0) (< 2147483647 (+ ~s_2~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4) 4)))))), 111463#(and (or (not (= |thread1Thread1of1ForFork3_~#t2~0.base| ~X_0~0.base)) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (= ~X_0~0.offset 0) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= ~s_6~0 0)) (or (= ~i_3~0 0) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (<= 0 ~s_6~0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (= (+ ~X_0~0.offset (* ~i_7~0 4)) 0) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0)) (or (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0) (= ~s_2~0 0)) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< 2147483647 (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)))) (< (+ ~s_6~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_7~0 4) 4)) 2147483648) 0))), 111464#(and (or (= ~X_0~0.offset 0) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (= ~s_2~0 0) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (= ~i_3~0 0) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (not (= |thread1Thread1of1ForFork3_~#t2~0.base| ~X_0~0.base)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)))) (or (not (= ~X_0~0.base |thread1Thread1of1ForFork3_~#t3~0.base|)) (< (+ (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) 2147483648) 0) (< 2147483647 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4))))), 111465#(and (or (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< (+ ~s_2~0 ~t_5~0) (+ ~s_6~0 1)) (< 2147483647 (+ ~s_2~0 ~t_5~0))) (or (<= ~s_6~0 (+ ~s_2~0 ~t_5~0)) (< (+ ~s_2~0 ~t_5~0 2147483648) 0) (< 2147483647 (+ ~s_2~0 ~t_5~0))))] [2022-03-15 19:03:38,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:03:38,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:38,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:03:38,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=664, Unknown=4, NotChecked=106, Total=870 [2022-03-15 19:03:38,030 INFO L87 Difference]: Start difference. First operand 1247 states and 4371 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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:03:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:38,932 INFO L93 Difference]: Finished difference Result 1972 states and 6895 transitions. [2022-03-15 19:03:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:03:38,932 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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 36 [2022-03-15 19:03:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:38,936 INFO L225 Difference]: With dead ends: 1972 [2022-03-15 19:03:38,936 INFO L226 Difference]: Without dead ends: 1929 [2022-03-15 19:03:38,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 110 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=1228, Unknown=4, NotChecked=146, Total=1560 [2022-03-15 19:03:38,937 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 180 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:38,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 209 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:03:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2022-03-15 19:03:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1211. [2022-03-15 19:03:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1210 states have (on average 3.5148760330578512) internal successors, (4253), 1210 states have internal predecessors, (4253), 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:03:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 4253 transitions. [2022-03-15 19:03:38,958 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 4253 transitions. Word has length 36 [2022-03-15 19:03:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:38,958 INFO L470 AbstractCegarLoop]: Abstraction has 1211 states and 4253 transitions. [2022-03-15 19:03:38,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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:03:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 4253 transitions. [2022-03-15 19:03:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:03:38,960 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:38,960 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:38,976 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:03:39,160 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,SelfDestructingSolverStorable28 [2022-03-15 19:03:39,160 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:39,161 INFO L85 PathProgramCache]: Analyzing trace with hash -258059794, now seen corresponding path program 14 times [2022-03-15 19:03:39,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:39,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066712163] [2022-03-15 19:03:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:39,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:39,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:39,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066712163] [2022-03-15 19:03:39,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066712163] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:39,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128229718] [2022-03-15 19:03:39,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:03:39,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:39,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:39,210 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:03:39,211 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:03:39,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:03:39,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:39,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:03:39,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:39,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:39,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128229718] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:39,524 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:39,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 19:03:39,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134809754] [2022-03-15 19:03:39,524 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:39,527 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:39,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 168 states and 347 transitions. [2022-03-15 19:03:39,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:40,578 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:03:40,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:03:40,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:40,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:03:40,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:03:40,579 INFO L87 Difference]: Start difference. First operand 1211 states and 4253 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 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:03:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:40,771 INFO L93 Difference]: Finished difference Result 2421 states and 8179 transitions. [2022-03-15 19:03:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:03:40,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 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 37 [2022-03-15 19:03:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:40,776 INFO L225 Difference]: With dead ends: 2421 [2022-03-15 19:03:40,776 INFO L226 Difference]: Without dead ends: 2155 [2022-03-15 19:03:40,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:03:40,776 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 106 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:40,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 133 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:03:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2022-03-15 19:03:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 1879. [2022-03-15 19:03:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1878 states have (on average 3.4483493077742278) internal successors, (6476), 1878 states have internal predecessors, (6476), 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:03:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 6476 transitions. [2022-03-15 19:03:40,806 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 6476 transitions. Word has length 37 [2022-03-15 19:03:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:40,806 INFO L470 AbstractCegarLoop]: Abstraction has 1879 states and 6476 transitions. [2022-03-15 19:03:40,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 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:03:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 6476 transitions. [2022-03-15 19:03:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:03:40,809 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:40,809 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:40,828 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:03:41,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:41,010 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash -173256605, now seen corresponding path program 15 times [2022-03-15 19:03:41,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:41,011 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20092980] [2022-03-15 19:03:41,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:41,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:41,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20092980] [2022-03-15 19:03:41,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20092980] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:41,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021302081] [2022-03-15 19:03:41,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:03:41,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:41,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:41,058 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:03:41,059 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:03:41,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:03:41,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:41,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:41,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:41,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:41,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021302081] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:41,360 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:41,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 19:03:41,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136734649] [2022-03-15 19:03:41,360 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:41,363 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:41,400 INFO L252 McrAutomatonBuilder]: Finished intersection with 166 states and 338 transitions. [2022-03-15 19:03:41,401 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:42,313 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [122540#(or (< (+ ~i_3~0 2) ~n_1~0) (<= ~n_1~0 (+ ~i_3~0 1))), 122539#(or (< (+ ~i_3~0 1) ~n_1~0) (<= ~n_1~0 ~i_3~0)), 122538#(< ~i_3~0 ~n_1~0)] [2022-03-15 19:03:42,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:03:42,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:03:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:03:42,314 INFO L87 Difference]: Start difference. First operand 1879 states and 6476 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 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:03:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:42,470 INFO L93 Difference]: Finished difference Result 1501 states and 5024 transitions. [2022-03-15 19:03:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:03:42,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 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 38 [2022-03-15 19:03:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:42,473 INFO L225 Difference]: With dead ends: 1501 [2022-03-15 19:03:42,473 INFO L226 Difference]: Without dead ends: 1212 [2022-03-15 19:03:42,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:03:42,476 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 146 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:42,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 107 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:03:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2022-03-15 19:03:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2022-03-15 19:03:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 3.512799339388935) internal successors, (4254), 1211 states have internal predecessors, (4254), 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:03:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 4254 transitions. [2022-03-15 19:03:42,492 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 4254 transitions. Word has length 38 [2022-03-15 19:03:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:42,492 INFO L470 AbstractCegarLoop]: Abstraction has 1212 states and 4254 transitions. [2022-03-15 19:03:42,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 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:03:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 4254 transitions. [2022-03-15 19:03:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 19:03:42,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:42,494 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:42,512 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:03:42,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:42,695 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:42,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1693065051, now seen corresponding path program 16 times [2022-03-15 19:03:42,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:42,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754275434] [2022-03-15 19:03:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:03:42,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:42,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754275434] [2022-03-15 19:03:42,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754275434] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:42,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273722629] [2022-03-15 19:03:42,748 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:03:42,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:42,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:42,752 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:03:42,753 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:03:42,886 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:03:42,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:42,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:03:42,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:03:42,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:03:43,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273722629] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:43,040 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:43,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2022-03-15 19:03:43,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1022948366] [2022-03-15 19:03:43,040 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:43,043 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:43,102 INFO L252 McrAutomatonBuilder]: Finished intersection with 169 states and 348 transitions. [2022-03-15 19:03:43,102 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:44,032 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [126710#(or (<= (+ ~i_3~0 2) ~n_1~0) (<= ~n_1~0 ~i_3~0))] [2022-03-15 19:03:44,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:03:44,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:44,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:03:44,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:03:44,033 INFO L87 Difference]: Start difference. First operand 1212 states and 4254 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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:03:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:44,156 INFO L93 Difference]: Finished difference Result 1116 states and 3892 transitions. [2022-03-15 19:03:44,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:03:44,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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 38 [2022-03-15 19:03:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:44,158 INFO L225 Difference]: With dead ends: 1116 [2022-03-15 19:03:44,158 INFO L226 Difference]: Without dead ends: 1116 [2022-03-15 19:03:44,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 189 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:03:44,159 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 193 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:44,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 46 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:03:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-03-15 19:03:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 996. [2022-03-15 19:03:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 3.5095477386934673) internal successors, (3492), 995 states have internal predecessors, (3492), 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:03:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 3492 transitions. [2022-03-15 19:03:44,172 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 3492 transitions. Word has length 38 [2022-03-15 19:03:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:44,172 INFO L470 AbstractCegarLoop]: Abstraction has 996 states and 3492 transitions. [2022-03-15 19:03:44,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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:03:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 3492 transitions. [2022-03-15 19:03:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-15 19:03:44,173 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:44,173 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:44,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 19:03:44,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:44,374 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash 182071446, now seen corresponding path program 17 times [2022-03-15 19:03:44,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:44,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546192350] [2022-03-15 19:03:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:03:44,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:44,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546192350] [2022-03-15 19:03:44,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546192350] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:44,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753064003] [2022-03-15 19:03:44,458 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:03:44,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:44,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:44,460 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:03:44,465 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:03:44,597 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:03:44,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:44,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:44,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:03:44,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:03:44,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753064003] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:44,795 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:44,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2022-03-15 19:03:44,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417153864] [2022-03-15 19:03:44,795 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:44,799 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:44,840 INFO L252 McrAutomatonBuilder]: Finished intersection with 167 states and 339 transitions. [2022-03-15 19:03:44,841 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:45,818 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:03:45,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:03:45,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:45,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:03:45,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:03:45,818 INFO L87 Difference]: Start difference. First operand 996 states and 3492 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 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:03:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:45,922 INFO L93 Difference]: Finished difference Result 1174 states and 4009 transitions. [2022-03-15 19:03:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:03:45,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 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 39 [2022-03-15 19:03:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:45,924 INFO L225 Difference]: With dead ends: 1174 [2022-03-15 19:03:45,924 INFO L226 Difference]: Without dead ends: 1174 [2022-03-15 19:03:45,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 189 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:03:45,925 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 140 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:45,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 48 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:03:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-03-15 19:03:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1092. [2022-03-15 19:03:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 3.459211732355637) internal successors, (3774), 1091 states have internal predecessors, (3774), 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:03:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 3774 transitions. [2022-03-15 19:03:45,939 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 3774 transitions. Word has length 39 [2022-03-15 19:03:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:45,939 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 3774 transitions. [2022-03-15 19:03:45,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 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:03:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 3774 transitions. [2022-03-15 19:03:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-15 19:03:45,941 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:45,941 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, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:45,959 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:03:46,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:46,141 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 19:03:46,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:46,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1347573864, now seen corresponding path program 18 times [2022-03-15 19:03:46,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:46,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999580843] [2022-03-15 19:03:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:46,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:46,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999580843] [2022-03-15 19:03:46,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999580843] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:46,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173600301] [2022-03-15 19:03:46,517 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:03:46,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:46,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:46,518 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:03:46,519 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:03:46,668 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:03:46,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:46,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 125 conjunts are in the unsatisfiable core [2022-03-15 19:03:46,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:46,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:46,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:46,690 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 19:03:46,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-03-15 19:03:46,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 19:03:46,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:03:46,869 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 19:03:46,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-03-15 19:03:46,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:03:47,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-03-15 19:03:47,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:03:47,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-03-15 19:03:47,564 INFO L353 Elim1Store]: treesize reduction 64, result has 31.9 percent of original size [2022-03-15 19:03:47,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 42 [2022-03-15 19:03:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:47,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:48,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~i_7~0_954 Int)) (or (not (<= v_~i_7~0_954 2)) (and (forall ((v_ArrVal_1864 (Array Int Int)) (v_ArrVal_1863 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1863) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1864) c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) (select .cse0 (+ c_~X_0~0.offset (* v_~i_7~0_954 4))))) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_1864 (Array Int Int)) (v_ArrVal_1863 (Array Int Int))) (<= c_~s_2~0 (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1863) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1864) c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 4)) (select .cse1 (+ c_~X_0~0.offset (* v_~i_7~0_954 4)))))))) (< v_~i_7~0_954 c_~n_1~0))) is different from false [2022-03-15 19:03:50,855 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:03:50,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 163 [2022-03-15 19:03:50,918 INFO L353 Elim1Store]: treesize reduction 124, result has 21.0 percent of original size [2022-03-15 19:03:50,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64378 treesize of output 56530 [2022-03-15 19:03:51,612 INFO L353 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-03-15 19:03:51,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56189 treesize of output 53629 [2022-03-15 19:03:51,719 INFO L353 Elim1Store]: treesize reduction 85, result has 9.6 percent of original size [2022-03-15 19:03:51,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53629 treesize of output 49670 [2022-03-15 19:03:52,251 INFO L353 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-03-15 19:03:52,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49245 treesize of output 47965 [2022-03-15 19:03:52,359 INFO L353 Elim1Store]: treesize reduction 85, result has 9.6 percent of original size [2022-03-15 19:03:52,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47965 treesize of output 45990 [2022-03-15 19:03:52,762 INFO L353 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-03-15 19:03:52,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45885 treesize of output 40765 [2022-03-15 19:03:52,865 INFO L353 Elim1Store]: treesize reduction 85, result has 9.6 percent of original size [2022-03-15 19:03:52,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40765 treesize of output 32838 [2022-03-15 19:03:53,483 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 19:03:53,517 INFO L353 Elim1Store]: treesize reduction 85, result has 9.6 percent of original size [2022-03-15 19:03:53,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31997 treesize of output 28038 [2022-03-15 19:03:54,008 INFO L353 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-03-15 19:03:54,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27821 treesize of output 25261 [2022-03-15 19:03:54,085 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 19:03:54,102 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:03:54,285 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,SelfDestructingSolverStorable33 [2022-03-15 19:03:54,286 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 19:03:54,288 INFO L158 Benchmark]: Toolchain (without parser) took 128987.77ms. Allocated memory was 207.6MB in the beginning and 671.1MB in the end (delta: 463.5MB). Free memory was 157.7MB in the beginning and 319.7MB in the end (delta: -162.0MB). Peak memory consumption was 446.6MB. Max. memory is 8.0GB. [2022-03-15 19:03:54,288 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory was 174.2MB in the beginning and 174.0MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:03:54,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.84ms. Allocated memory is still 207.6MB. Free memory was 157.6MB in the beginning and 182.2MB in the end (delta: -24.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 19:03:54,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.36ms. Allocated memory is still 207.6MB. Free memory was 182.2MB in the beginning and 179.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:03:54,289 INFO L158 Benchmark]: Boogie Preprocessor took 37.94ms. Allocated memory is still 207.6MB. Free memory was 179.6MB in the beginning and 178.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:03:54,289 INFO L158 Benchmark]: RCFGBuilder took 602.19ms. Allocated memory is still 207.6MB. Free memory was 178.0MB in the beginning and 142.9MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-03-15 19:03:54,289 INFO L158 Benchmark]: TraceAbstraction took 128108.39ms. Allocated memory was 207.6MB in the beginning and 671.1MB in the end (delta: 463.5MB). Free memory was 142.4MB in the beginning and 319.7MB in the end (delta: -177.3MB). Peak memory consumption was 432.7MB. Max. memory is 8.0GB. [2022-03-15 19:03:54,289 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory was 174.2MB in the beginning and 174.0MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.84ms. Allocated memory is still 207.6MB. Free memory was 157.6MB in the beginning and 182.2MB in the end (delta: -24.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.36ms. Allocated memory is still 207.6MB. Free memory was 182.2MB in the beginning and 179.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.94ms. Allocated memory is still 207.6MB. Free memory was 179.6MB in the beginning and 178.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 602.19ms. Allocated memory is still 207.6MB. Free memory was 178.0MB in the beginning and 142.9MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 128108.39ms. Allocated memory was 207.6MB in the beginning and 671.1MB in the end (delta: 463.5MB). Free memory was 142.4MB in the beginning and 319.7MB in the end (delta: -177.3MB). Peak memory consumption was 432.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 204 PlacesBefore, 56 PlacesAfterwards, 205 TransitionsBefore, 49 TransitionsAfterwards, 2612 CoEnabledTransitionPairs, 8 FixpointIterations, 118 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 11 ConcurrentYvCompositions, 8 ChoiceCompositions, 182 TotalNumberOfCompositions, 8123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4652, positive: 4383, positive conditional: 0, positive unconditional: 4383, negative: 269, negative conditional: 0, negative unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1450, positive: 1424, positive conditional: 0, positive unconditional: 1424, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4652, positive: 2959, positive conditional: 0, positive unconditional: 2959, negative: 243, negative conditional: 0, negative unconditional: 243, unknown: 1450, unknown conditional: 0, unknown unconditional: 1450] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 19:03:54,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...