/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/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:26:39,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:26:39,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:26:39,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:26:39,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:26:39,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:26:39,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:26:39,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:26:39,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:26:39,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:26:39,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:26:39,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:26:39,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:26:39,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:26:39,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:26:39,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:26:39,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:26:39,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:26:39,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:26:39,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:26:39,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:26:39,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:26:39,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:26:39,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:26:39,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:26:39,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:26:39,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:26:39,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:26:39,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:26:39,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:26:39,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:26:39,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:26:39,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:26:39,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:26:39,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:26:39,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:26:39,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:26:39,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:26:39,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:26:39,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:26:39,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:26:39,436 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 17:26:39,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:26:39,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:26:39,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:26:39,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:26:39,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:26:39,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:26:39,452 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:26:39,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:26:39,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:26:39,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:26:39,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:26:39,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:26:39,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:26:39,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:26:39,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:26:39,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:26:39,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:26:39,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:26:39,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:26:39,454 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:26:39,454 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:26:39,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:26:39,454 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 17:26:39,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:26:39,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:26:39,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:26:39,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:26:39,658 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:26:39,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-03-15 17:26:39,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b249fb0/cf4ffc2d4a324aedaf60b783e658410f/FLAG3bfb1c7c7 [2022-03-15 17:26:40,170 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:26:40,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-03-15 17:26:40,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b249fb0/cf4ffc2d4a324aedaf60b783e658410f/FLAG3bfb1c7c7 [2022-03-15 17:26:40,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b249fb0/cf4ffc2d4a324aedaf60b783e658410f [2022-03-15 17:26:40,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:26:40,712 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:26:40,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:26:40,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:26:40,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:26:40,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:26:40" (1/1) ... [2022-03-15 17:26:40,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4c390c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:40, skipping insertion in model container [2022-03-15 17:26:40,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:26:40" (1/1) ... [2022-03-15 17:26:40,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:26:40,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:26:41,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-03-15 17:26:41,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:26:41,095 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:26:41,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-03-15 17:26:41,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:26:41,160 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:26:41,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41 WrapperNode [2022-03-15 17:26:41,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:26:41,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:26:41,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:26:41,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:26:41,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,194 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2022-03-15 17:26:41,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:26:41,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:26:41,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:26:41,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:26:41,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:26:41,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:26:41,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:26:41,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:26:41,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (1/1) ... [2022-03-15 17:26:41,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:26:41,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:26:41,240 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 17:26:41,267 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 17:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-15 17:26:41,292 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-15 17:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-15 17:26:41,292 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-15 17:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 17:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 17:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:26:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:26:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:26:41,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:26:41,294 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 17:26:41,366 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:26:41,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:26:41,576 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:26:41,591 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:26:41,591 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 17:26:41,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:26:41 BoogieIcfgContainer [2022-03-15 17:26:41,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:26:41,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:26:41,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:26:41,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:26:41,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:26:40" (1/3) ... [2022-03-15 17:26:41,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037a736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:26:41, skipping insertion in model container [2022-03-15 17:26:41,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:26:41" (2/3) ... [2022-03-15 17:26:41,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037a736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:26:41, skipping insertion in model container [2022-03-15 17:26:41,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:26:41" (3/3) ... [2022-03-15 17:26:41,598 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-03-15 17:26:41,601 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:26:41,602 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:26:41,602 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:26:41,602 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:26:41,674 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,678 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,679 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,679 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,679 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,679 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,679 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,679 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,679 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,680 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,681 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,681 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,681 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,681 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,681 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,681 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,681 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,682 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,682 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,682 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,682 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,682 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,692 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,693 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,695 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,696 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,696 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,697 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,698 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,699 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,699 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,699 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,699 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,699 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,700 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,702 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,702 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,703 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,704 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,705 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,706 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,706 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,706 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,706 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,707 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,707 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,707 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,709 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,709 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,709 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,709 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,713 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,714 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,714 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,714 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,714 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,715 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,715 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,715 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,716 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,716 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,716 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,716 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,717 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,717 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,718 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,718 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,726 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,727 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,728 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,728 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,730 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,737 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,738 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,739 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,740 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,741 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,744 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,744 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,744 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,744 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,744 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,744 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,744 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,747 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,747 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,747 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,748 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,748 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,748 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,748 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,748 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,748 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,748 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,748 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,748 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,749 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,749 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,749 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,749 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,751 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,752 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,753 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,754 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,754 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:26:41,758 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 17:26:41,801 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:26:41,806 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 17:26:41,806 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 17:26:41,818 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:26:41,826 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 176 transitions, 368 flow [2022-03-15 17:26:41,828 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 176 transitions, 368 flow [2022-03-15 17:26:41,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 176 transitions, 368 flow [2022-03-15 17:26:41,909 INFO L129 PetriNetUnfolder]: 10/174 cut-off events. [2022-03-15 17:26:41,909 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 17:26:41,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 174 events. 10/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 422 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2022-03-15 17:26:41,921 INFO L116 LiptonReduction]: Number of co-enabled transitions 8324 [2022-03-15 17:26:45,457 INFO L131 LiptonReduction]: Checked pairs total: 11261 [2022-03-15 17:26:45,457 INFO L133 LiptonReduction]: Total number of compositions: 166 [2022-03-15 17:26:45,473 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 36 transitions, 88 flow [2022-03-15 17:26:45,524 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 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 17:26:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 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 17:26:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 17:26:45,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:45,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-03-15 17:26:45,530 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:45,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash -509395203, now seen corresponding path program 1 times [2022-03-15 17:26:45,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:45,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360671759] [2022-03-15 17:26:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:45,736 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 17:26:45,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:45,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360671759] [2022-03-15 17:26:45,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360671759] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:26:45,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:26:45,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:26:45,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1974546217] [2022-03-15 17:26:45,739 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:26:45,741 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:26:45,748 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2022-03-15 17:26:45,748 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:26:45,750 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:26:45,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:26:45,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:26:45,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:26:45,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:26:45,770 INFO L87 Difference]: Start difference. First operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 17:26:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:26:45,850 INFO L93 Difference]: Finished difference Result 414 states and 1064 transitions. [2022-03-15 17:26:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:26:45,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-03-15 17:26:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:26:45,866 INFO L225 Difference]: With dead ends: 414 [2022-03-15 17:26:45,866 INFO L226 Difference]: Without dead ends: 396 [2022-03-15 17:26:45,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:26:45,869 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:26:45,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:26:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-03-15 17:26:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 372. [2022-03-15 17:26:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 369 states have (on average 2.6856368563685638) internal successors, (991), 371 states have internal predecessors, (991), 0 states have call successors, (0), 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 17:26:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 991 transitions. [2022-03-15 17:26:45,931 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 991 transitions. Word has length 6 [2022-03-15 17:26:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:26:45,932 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 991 transitions. [2022-03-15 17:26:45,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 17:26:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 991 transitions. [2022-03-15 17:26:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 17:26:45,936 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:45,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:26:45,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:26:45,937 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1101509934, now seen corresponding path program 1 times [2022-03-15 17:26:45,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:45,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947182187] [2022-03-15 17:26:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:46,032 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 17:26:46,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:46,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947182187] [2022-03-15 17:26:46,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947182187] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:26:46,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:26:46,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:26:46,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63202884] [2022-03-15 17:26:46,033 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:26:46,034 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:26:46,035 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 17:26:46,035 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:26:46,035 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:26:46,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:26:46,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:26:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:26:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:26:46,036 INFO L87 Difference]: Start difference. First operand 372 states and 991 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 17:26:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:26:46,087 INFO L93 Difference]: Finished difference Result 410 states and 1089 transitions. [2022-03-15 17:26:46,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:26:46,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-03-15 17:26:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:26:46,089 INFO L225 Difference]: With dead ends: 410 [2022-03-15 17:26:46,089 INFO L226 Difference]: Without dead ends: 410 [2022-03-15 17:26:46,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:26:46,090 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:26:46,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:26:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-03-15 17:26:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-03-15 17:26:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 407 states have (on average 2.675675675675676) internal successors, (1089), 409 states have internal predecessors, (1089), 0 states have call successors, (0), 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 17:26:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1089 transitions. [2022-03-15 17:26:46,104 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1089 transitions. Word has length 10 [2022-03-15 17:26:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:26:46,104 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 1089 transitions. [2022-03-15 17:26:46,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 17:26:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1089 transitions. [2022-03-15 17:26:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 17:26:46,105 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:46,105 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:26:46,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:26:46,105 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1530966523, now seen corresponding path program 1 times [2022-03-15 17:26:46,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:46,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922139588] [2022-03-15 17:26:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:46,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:46,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922139588] [2022-03-15 17:26:46,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922139588] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:26:46,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883874910] [2022-03-15 17:26:46,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:46,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:26:46,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:26:46,172 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 17:26:46,203 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 17:26:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:46,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 17:26:46,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:26:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:46,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:26:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:46,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883874910] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:26:46,373 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:26:46,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 17:26:46,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895779865] [2022-03-15 17:26:46,373 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:26:46,374 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:26:46,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 17:26:46,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:26:46,376 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:26:46,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:26:46,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:26:46,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:26:46,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:26:46,377 INFO L87 Difference]: Start difference. First operand 410 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 17:26:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:26:46,469 INFO L93 Difference]: Finished difference Result 666 states and 1725 transitions. [2022-03-15 17:26:46,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:26:46,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-03-15 17:26:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:26:46,473 INFO L225 Difference]: With dead ends: 666 [2022-03-15 17:26:46,473 INFO L226 Difference]: Without dead ends: 666 [2022-03-15 17:26:46,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:26:46,474 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:26:46,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:26:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-03-15 17:26:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 514. [2022-03-15 17:26:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 511 states have (on average 2.7084148727984343) internal successors, (1384), 513 states have internal predecessors, (1384), 0 states have call successors, (0), 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 17:26:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1384 transitions. [2022-03-15 17:26:46,489 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1384 transitions. Word has length 13 [2022-03-15 17:26:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:26:46,489 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 1384 transitions. [2022-03-15 17:26:46,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 17:26:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1384 transitions. [2022-03-15 17:26:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:26:46,496 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:46,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:26:46,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 17:26:46,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:26:46,710 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:46,711 INFO L85 PathProgramCache]: Analyzing trace with hash -253426811, now seen corresponding path program 1 times [2022-03-15 17:26:46,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:46,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245852158] [2022-03-15 17:26:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:46,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:46,813 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 17:26:46,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:46,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245852158] [2022-03-15 17:26:46,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245852158] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:26:46,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:26:46,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:26:46,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1147509055] [2022-03-15 17:26:46,814 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:26:46,816 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:26:46,820 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 62 transitions. [2022-03-15 17:26:46,820 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:26:47,010 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [4915#(not (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0))] [2022-03-15 17:26:47,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:26:47,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:26:47,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:26:47,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:26:47,012 INFO L87 Difference]: Start difference. First operand 514 states and 1384 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 17:26:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:26:47,051 INFO L93 Difference]: Finished difference Result 242 states and 546 transitions. [2022-03-15 17:26:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:26:47,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 16 [2022-03-15 17:26:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:26:47,053 INFO L225 Difference]: With dead ends: 242 [2022-03-15 17:26:47,053 INFO L226 Difference]: Without dead ends: 242 [2022-03-15 17:26:47,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:26:47,054 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:26:47,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 1 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:26:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-03-15 17:26:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 232. [2022-03-15 17:26:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 2.256521739130435) internal successors, (519), 231 states have internal predecessors, (519), 0 states have call successors, (0), 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 17:26:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 519 transitions. [2022-03-15 17:26:47,059 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 519 transitions. Word has length 16 [2022-03-15 17:26:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:26:47,060 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 519 transitions. [2022-03-15 17:26:47,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 17:26:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 519 transitions. [2022-03-15 17:26:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:26:47,060 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:47,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:26:47,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:26:47,061 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash -583131400, now seen corresponding path program 1 times [2022-03-15 17:26:47,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:47,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362640983] [2022-03-15 17:26:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:47,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:47,093 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 17:26:47,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:47,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362640983] [2022-03-15 17:26:47,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362640983] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:26:47,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:26:47,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:26:47,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [27651189] [2022-03-15 17:26:47,093 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:26:47,095 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:26:47,099 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2022-03-15 17:26:47,099 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:26:47,121 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:26:47,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:26:47,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:26:47,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:26:47,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:26:47,122 INFO L87 Difference]: Start difference. First operand 232 states and 519 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17:26:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:26:47,182 INFO L93 Difference]: Finished difference Result 290 states and 645 transitions. [2022-03-15 17:26:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:26:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-03-15 17:26:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:26:47,184 INFO L225 Difference]: With dead ends: 290 [2022-03-15 17:26:47,184 INFO L226 Difference]: Without dead ends: 290 [2022-03-15 17:26:47,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:26:47,186 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:26:47,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:26:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-03-15 17:26:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 248. [2022-03-15 17:26:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 246 states have (on average 2.231707317073171) internal successors, (549), 247 states have internal predecessors, (549), 0 states have call successors, (0), 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 17:26:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 549 transitions. [2022-03-15 17:26:47,193 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 549 transitions. Word has length 17 [2022-03-15 17:26:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:26:47,194 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 549 transitions. [2022-03-15 17:26:47,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17:26:47,194 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 549 transitions. [2022-03-15 17:26:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 17:26:47,195 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:47,195 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-03-15 17:26:47,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:26:47,195 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash -624048643, now seen corresponding path program 2 times [2022-03-15 17:26:47,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:47,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546184606] [2022-03-15 17:26:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:47,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:47,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546184606] [2022-03-15 17:26:47,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546184606] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:26:47,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792728047] [2022-03-15 17:26:47,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:26:47,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:26:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:26:47,260 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 17:26:47,261 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 17:26:47,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:26:47,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:26:47,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 17:26:47,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:26:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:47,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:26:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:47,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792728047] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:26:47,423 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:26:47,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 17:26:47,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737516803] [2022-03-15 17:26:47,423 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:26:47,425 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:26:47,427 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2022-03-15 17:26:47,427 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:26:47,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:26:47,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:26:47,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:26:47,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:26:47,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-15 17:26:47,429 INFO L87 Difference]: Start difference. First operand 248 states and 549 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 17:26:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:26:47,533 INFO L93 Difference]: Finished difference Result 404 states and 884 transitions. [2022-03-15 17:26:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:26:47,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-03-15 17:26:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:26:47,535 INFO L225 Difference]: With dead ends: 404 [2022-03-15 17:26:47,535 INFO L226 Difference]: Without dead ends: 404 [2022-03-15 17:26:47,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-03-15 17:26:47,536 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:26:47,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:26:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-03-15 17:26:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 304. [2022-03-15 17:26:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 302 states have (on average 2.23841059602649) internal successors, (676), 303 states have internal predecessors, (676), 0 states have call successors, (0), 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 17:26:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 676 transitions. [2022-03-15 17:26:47,542 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 676 transitions. Word has length 20 [2022-03-15 17:26:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:26:47,542 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 676 transitions. [2022-03-15 17:26:47,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 17:26:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 676 transitions. [2022-03-15 17:26:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:26:47,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:47,543 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] [2022-03-15 17:26:47,562 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 17:26:47,759 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 17:26:47,759 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993315, now seen corresponding path program 1 times [2022-03-15 17:26:47,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:47,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39914183] [2022-03-15 17:26:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:48,024 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 17:26:48,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:48,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39914183] [2022-03-15 17:26:48,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39914183] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:26:48,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:26:48,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 17:26:48,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1585113411] [2022-03-15 17:26:48,025 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:26:48,027 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:26:48,032 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 61 transitions. [2022-03-15 17:26:48,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:26:48,507 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:26:48,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 17:26:48,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:26:48,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 17:26:48,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-03-15 17:26:48,508 INFO L87 Difference]: Start difference. First operand 304 states and 676 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:26:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:26:49,489 INFO L93 Difference]: Finished difference Result 511 states and 1114 transitions. [2022-03-15 17:26:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 17:26:49,489 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 21 [2022-03-15 17:26:49,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:26:49,491 INFO L225 Difference]: With dead ends: 511 [2022-03-15 17:26:49,491 INFO L226 Difference]: Without dead ends: 454 [2022-03-15 17:26:49,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2022-03-15 17:26:49,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 17:26:49,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 17:26:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-03-15 17:26:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 358. [2022-03-15 17:26:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 356 states have (on average 2.2387640449438204) internal successors, (797), 357 states have internal predecessors, (797), 0 states have call successors, (0), 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 17:26:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 797 transitions. [2022-03-15 17:26:49,499 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 797 transitions. Word has length 21 [2022-03-15 17:26:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:26:49,499 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 797 transitions. [2022-03-15 17:26:49,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:26:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 797 transitions. [2022-03-15 17:26:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:26:49,500 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:49,500 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] [2022-03-15 17:26:49,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:26:49,500 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:49,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1395187971, now seen corresponding path program 2 times [2022-03-15 17:26:49,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:49,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248892954] [2022-03-15 17:26:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:49,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:49,884 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 17:26:49,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:49,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248892954] [2022-03-15 17:26:49,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248892954] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:26:49,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:26:49,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-15 17:26:49,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [518029191] [2022-03-15 17:26:49,884 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:26:49,887 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:26:49,890 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 17:26:49,890 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:26:50,103 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8847#(and (<= 0 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (<= ~top~0 0)), 8846#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (<= 0 |t1Thread1of1ForFork0_inc_top_#t~post31#1|))] [2022-03-15 17:26:50,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 17:26:50,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:26:50,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 17:26:50,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-03-15 17:26:50,105 INFO L87 Difference]: Start difference. First operand 358 states and 797 transitions. Second operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 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 17:26:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:26:50,914 INFO L93 Difference]: Finished difference Result 500 states and 1085 transitions. [2022-03-15 17:26:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 17:26:50,914 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 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 21 [2022-03-15 17:26:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:26:50,916 INFO L225 Difference]: With dead ends: 500 [2022-03-15 17:26:50,916 INFO L226 Difference]: Without dead ends: 450 [2022-03-15 17:26:50,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-03-15 17:26:50,917 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 17:26:50,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 17:26:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-03-15 17:26:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 382. [2022-03-15 17:26:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 380 states have (on average 2.213157894736842) internal successors, (841), 381 states have internal predecessors, (841), 0 states have call successors, (0), 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 17:26:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 841 transitions. [2022-03-15 17:26:50,923 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 841 transitions. Word has length 21 [2022-03-15 17:26:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:26:50,924 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 841 transitions. [2022-03-15 17:26:50,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 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 17:26:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 841 transitions. [2022-03-15 17:26:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 17:26:50,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:50,924 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-03-15 17:26:50,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:26:50,925 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1493244155, now seen corresponding path program 3 times [2022-03-15 17:26:50,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:50,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419132570] [2022-03-15 17:26:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:51,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:51,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419132570] [2022-03-15 17:26:51,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419132570] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:26:51,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091201762] [2022-03-15 17:26:51,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:26:51,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:26:51,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:26:51,007 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 17:26:51,063 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 17:26:51,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 17:26:51,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:26:51,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 17:26:51,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:26:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:51,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:26:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:51,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091201762] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:26:51,241 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:26:51,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-03-15 17:26:51,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1420824928] [2022-03-15 17:26:51,241 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:26:51,245 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:26:51,250 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2022-03-15 17:26:51,250 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:26:51,251 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:26:51,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 17:26:51,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:26:51,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 17:26:51,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-15 17:26:51,251 INFO L87 Difference]: Start difference. First operand 382 states and 841 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 17:26:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:26:51,399 INFO L93 Difference]: Finished difference Result 622 states and 1343 transitions. [2022-03-15 17:26:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:26:51,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 17:26:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:26:51,402 INFO L225 Difference]: With dead ends: 622 [2022-03-15 17:26:51,402 INFO L226 Difference]: Without dead ends: 622 [2022-03-15 17:26:51,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-03-15 17:26:51,403 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:26:51,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:26:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-03-15 17:26:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 454. [2022-03-15 17:26:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 452 states have (on average 2.2389380530973453) internal successors, (1012), 453 states have internal predecessors, (1012), 0 states have call successors, (0), 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 17:26:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1012 transitions. [2022-03-15 17:26:51,412 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1012 transitions. Word has length 27 [2022-03-15 17:26:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:26:51,413 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 1012 transitions. [2022-03-15 17:26:51,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 17:26:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1012 transitions. [2022-03-15 17:26:51,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 17:26:51,413 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:26:51,414 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:26:51,432 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 17:26:51,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:26:51,627 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:26:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:26:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2120607685, now seen corresponding path program 3 times [2022-03-15 17:26:51,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:26:51,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403906346] [2022-03-15 17:26:51,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:26:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:26:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:26:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:26:52,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:26:52,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403906346] [2022-03-15 17:26:52,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403906346] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:26:52,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921198860] [2022-03-15 17:26:52,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:26:52,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:26:52,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:26:52,064 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 17:26:52,065 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 17:26:52,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 17:26:52,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:26:52,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 17:26:52,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:26:52,390 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 19 treesize of output 15 [2022-03-15 17:26:52,745 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 110 treesize of output 46 [2022-03-15 17:27:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:27:15,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 17:27:15,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921198860] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:27:15,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 17:27:15,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 28 [2022-03-15 17:27:15,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1454133214] [2022-03-15 17:27:15,093 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:27:15,096 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:27:15,107 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 96 transitions. [2022-03-15 17:27:15,108 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:27:15,632 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:27:15,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 17:27:15,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:27:15,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 17:27:15,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=792, Unknown=11, NotChecked=0, Total=870 [2022-03-15 17:27:15,634 INFO L87 Difference]: Start difference. First operand 454 states and 1012 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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 17:27:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:27:19,504 INFO L93 Difference]: Finished difference Result 946 states and 2083 transitions. [2022-03-15 17:27:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 17:27:19,505 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 17:27:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:27:19,508 INFO L225 Difference]: With dead ends: 946 [2022-03-15 17:27:19,508 INFO L226 Difference]: Without dead ends: 946 [2022-03-15 17:27:19,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=218, Invalid=1841, Unknown=11, NotChecked=0, Total=2070 [2022-03-15 17:27:19,509 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 124 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:27:19,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 9 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 977 Invalid, 0 Unknown, 130 Unchecked, 0.7s Time] [2022-03-15 17:27:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2022-03-15 17:27:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 657. [2022-03-15 17:27:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 655 states have (on average 2.3572519083969468) internal successors, (1544), 656 states have internal predecessors, (1544), 0 states have call successors, (0), 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 17:27:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1544 transitions. [2022-03-15 17:27:19,522 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1544 transitions. Word has length 28 [2022-03-15 17:27:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:27:19,522 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 1544 transitions. [2022-03-15 17:27:19,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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 17:27:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1544 transitions. [2022-03-15 17:27:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 17:27:19,525 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:27:19,525 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:27:19,542 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 17:27:19,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:27:19,737 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:27:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:27:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash 219930875, now seen corresponding path program 4 times [2022-03-15 17:27:19,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:27:19,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815351241] [2022-03-15 17:27:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:27:19,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:27:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:27:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:27:20,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:27:20,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815351241] [2022-03-15 17:27:20,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815351241] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:27:20,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275185290] [2022-03-15 17:27:20,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:27:20,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:27:20,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:27:20,152 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 17:27:20,153 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 17:27:20,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:27:20,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:27:20,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 17:27:20,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:27:20,265 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:27:20,265 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 17:27:20,632 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 19 treesize of output 15 [2022-03-15 17:27:20,808 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 50 treesize of output 46 [2022-03-15 17:27:21,185 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 78 treesize of output 46 [2022-03-15 17:27:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:27:45,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:27:45,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_342 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_342) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ (* (div .cse0 4294967296) 4294967296) 4294967294))))) is different from false [2022-03-15 17:27:45,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_342 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_342) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296)))))) is different from false [2022-03-15 17:27:45,714 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_342 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_342) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= (+ (* 4294967296 (div .cse0 4294967296)) 4294967294) .cse0)))) is different from false [2022-03-15 17:27:45,722 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:27:45,722 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 56 treesize of output 45 [2022-03-15 17:27:45,742 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:27:45,742 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 71 treesize of output 66 [2022-03-15 17:27:45,745 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 42 treesize of output 30 [2022-03-15 17:27:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-15 17:27:45,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275185290] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:27:45,951 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:27:45,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 44 [2022-03-15 17:27:45,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928065849] [2022-03-15 17:27:45,951 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:27:45,955 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:27:45,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 46 transitions. [2022-03-15 17:27:45,962 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:27:46,245 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14451#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 4) 4) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 4))), 14450#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 4) 4) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) (<= 1 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 4)))] [2022-03-15 17:27:46,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 17:27:46,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:27:46,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 17:27:46,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1807, Unknown=15, NotChecked=264, Total=2256 [2022-03-15 17:27:46,247 INFO L87 Difference]: Start difference. First operand 657 states and 1544 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:27:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:27:47,938 INFO L93 Difference]: Finished difference Result 892 states and 2012 transitions. [2022-03-15 17:27:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 17:27:47,939 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 17:27:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:27:47,942 INFO L225 Difference]: With dead ends: 892 [2022-03-15 17:27:47,942 INFO L226 Difference]: Without dead ends: 892 [2022-03-15 17:27:47,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=357, Invalid=3300, Unknown=15, NotChecked=360, Total=4032 [2022-03-15 17:27:47,943 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 17:27:47,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 17:27:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-03-15 17:27:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 719. [2022-03-15 17:27:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 717 states have (on average 2.3375174337517435) internal successors, (1676), 718 states have internal predecessors, (1676), 0 states have call successors, (0), 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 17:27:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1676 transitions. [2022-03-15 17:27:47,954 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1676 transitions. Word has length 28 [2022-03-15 17:27:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:27:47,955 INFO L470 AbstractCegarLoop]: Abstraction has 719 states and 1676 transitions. [2022-03-15 17:27:47,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:27:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1676 transitions. [2022-03-15 17:27:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 17:27:47,956 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:27:47,956 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:27:47,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 17:27:48,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 17:27:48,172 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:27:48,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:27:48,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1628568180, now seen corresponding path program 1 times [2022-03-15 17:27:48,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:27:48,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571779983] [2022-03-15 17:27:48,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:27:48,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:27:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:27:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:27:48,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:27:48,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571779983] [2022-03-15 17:27:48,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571779983] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:27:48,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905785766] [2022-03-15 17:27:48,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:27:48,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:27:48,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:27:48,248 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 17:27:48,249 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 17:27:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:27:48,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 17:27:48,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:27:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:27:48,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:27:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:27:48,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905785766] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:27:48,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:27:48,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2022-03-15 17:27:48,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341095493] [2022-03-15 17:27:48,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:27:48,485 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:27:48,493 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 49 transitions. [2022-03-15 17:27:48,493 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:27:48,526 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:27:48,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 17:27:48,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:27:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 17:27:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-15 17:27:48,527 INFO L87 Difference]: Start difference. First operand 719 states and 1676 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:27:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:27:48,699 INFO L93 Difference]: Finished difference Result 953 states and 2144 transitions. [2022-03-15 17:27:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:27:48,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:27:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:27:48,703 INFO L225 Difference]: With dead ends: 953 [2022-03-15 17:27:48,703 INFO L226 Difference]: Without dead ends: 921 [2022-03-15 17:27:48,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-03-15 17:27:48,704 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:27:48,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:27:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-03-15 17:27:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 767. [2022-03-15 17:27:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 765 states have (on average 2.326797385620915) internal successors, (1780), 766 states have internal predecessors, (1780), 0 states have call successors, (0), 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 17:27:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1780 transitions. [2022-03-15 17:27:48,718 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1780 transitions. Word has length 31 [2022-03-15 17:27:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:27:48,718 INFO L470 AbstractCegarLoop]: Abstraction has 767 states and 1780 transitions. [2022-03-15 17:27:48,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:27:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1780 transitions. [2022-03-15 17:27:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 17:27:48,719 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:27:48,719 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2022-03-15 17:27:48,749 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 17:27:48,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:27:48,936 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:27:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:27:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash 931138813, now seen corresponding path program 4 times [2022-03-15 17:27:48,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:27:48,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936203722] [2022-03-15 17:27:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:27:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:27:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:27:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:27:49,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:27:49,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936203722] [2022-03-15 17:27:49,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936203722] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:27:49,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209311257] [2022-03-15 17:27:49,039 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:27:49,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:27:49,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:27:49,040 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 17:27:49,083 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 17:27:49,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:27:49,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:27:49,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 17:27:49,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:27:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:27:49,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:27:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:27:49,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209311257] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:27:49,295 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:27:49,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2022-03-15 17:27:49,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599788843] [2022-03-15 17:27:49,295 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:27:49,299 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:27:49,306 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2022-03-15 17:27:49,306 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:27:49,306 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:27:49,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:27:49,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:27:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:27:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-15 17:27:49,307 INFO L87 Difference]: Start difference. First operand 767 states and 1780 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 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 17:27:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:27:49,485 INFO L93 Difference]: Finished difference Result 1147 states and 2576 transitions. [2022-03-15 17:27:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 17:27:49,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 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 17:27:49,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:27:49,489 INFO L225 Difference]: With dead ends: 1147 [2022-03-15 17:27:49,489 INFO L226 Difference]: Without dead ends: 1147 [2022-03-15 17:27:49,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-03-15 17:27:49,490 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:27:49,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:27:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-03-15 17:27:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 857. [2022-03-15 17:27:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 855 states have (on average 2.3403508771929826) internal successors, (2001), 856 states have internal predecessors, (2001), 0 states have call successors, (0), 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 17:27:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 2001 transitions. [2022-03-15 17:27:49,525 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 2001 transitions. Word has length 34 [2022-03-15 17:27:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:27:49,525 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 2001 transitions. [2022-03-15 17:27:49,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 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 17:27:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 2001 transitions. [2022-03-15 17:27:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 17:27:49,526 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:27:49,527 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:27:49,545 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 17:27:49,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:27:49,743 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:27:49,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:27:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1933608445, now seen corresponding path program 5 times [2022-03-15 17:27:49,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:27:49,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773642923] [2022-03-15 17:27:49,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:27:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:27:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:27:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:27:50,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:27:50,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773642923] [2022-03-15 17:27:50,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773642923] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:27:50,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071276732] [2022-03-15 17:27:50,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:27:50,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:27:50,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:27:50,246 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 17:27:50,247 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 17:27:50,343 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 17:27:50,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:27:50,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 17:27:50,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:27:50,362 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:27:50,362 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 17:27:50,656 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 19 treesize of output 15 [2022-03-15 17:27:50,814 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 62 treesize of output 58 [2022-03-15 17:27:51,163 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 110 treesize of output 46 [2022-03-15 17:27:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:27:51,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:27:51,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_536 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_536) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ 4294967294 (* (div .cse0 4294967296) 4294967296)) .cse0)))) is different from false [2022-03-15 17:27:51,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_536 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_536) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)))) (= .cse0 (+ (* (div .cse0 4294967296) 4294967296) 4294967294))))) is different from false [2022-03-15 17:27:51,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_536 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_536) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296)))))) is different from false [2022-03-15 17:27:51,697 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:27:51,697 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 56 treesize of output 45 [2022-03-15 17:27:51,704 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:27:51,704 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 71 treesize of output 66 [2022-03-15 17:27:51,707 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 42 treesize of output 30 [2022-03-15 17:27:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2022-03-15 17:27:51,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071276732] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:27:51,972 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:27:51,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 44 [2022-03-15 17:27:51,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [575295264] [2022-03-15 17:27:51,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:27:51,976 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:27:51,984 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 53 transitions. [2022-03-15 17:27:51,985 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:27:52,258 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [22831#(and (= |~#arr~0.offset| 0) (<= (* ~top~0 4) (+ |~#arr~0.offset| 8)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8)) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8))) (<= (+ |~#arr~0.offset| 8) (* ~top~0 4))), 22830#(and (<= (+ |~#arr~0.offset| 8) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (<= (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (+ |~#arr~0.offset| 8)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8)) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8))))] [2022-03-15 17:27:52,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 17:27:52,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:27:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 17:27:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1835, Unknown=3, NotChecked=264, Total=2256 [2022-03-15 17:27:52,259 INFO L87 Difference]: Start difference. First operand 857 states and 2001 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 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 17:27:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:27:53,993 INFO L93 Difference]: Finished difference Result 1111 states and 2507 transitions. [2022-03-15 17:27:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 17:27:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 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 17:27:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:27:53,997 INFO L225 Difference]: With dead ends: 1111 [2022-03-15 17:27:53,997 INFO L226 Difference]: Without dead ends: 1111 [2022-03-15 17:27:53,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=272, Invalid=2817, Unknown=3, NotChecked=330, Total=3422 [2022-03-15 17:27:53,998 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:27:53,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 0 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 17:27:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-03-15 17:27:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 865. [2022-03-15 17:27:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 863 states have (on average 2.340672074159907) internal successors, (2020), 864 states have internal predecessors, (2020), 0 states have call successors, (0), 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 17:27:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 2020 transitions. [2022-03-15 17:27:54,014 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 2020 transitions. Word has length 35 [2022-03-15 17:27:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:27:54,014 INFO L470 AbstractCegarLoop]: Abstraction has 865 states and 2020 transitions. [2022-03-15 17:27:54,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 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 17:27:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 2020 transitions. [2022-03-15 17:27:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:27:54,015 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:27:54,015 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:27:54,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 17:27:54,230 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,SelfDestructingSolverStorable13 [2022-03-15 17:27:54,231 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:27:54,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:27:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1437122815, now seen corresponding path program 1 times [2022-03-15 17:27:54,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:27:54,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34976256] [2022-03-15 17:27:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:27:54,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:27:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:27:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:27:54,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:27:54,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34976256] [2022-03-15 17:27:54,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34976256] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:27:54,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657916006] [2022-03-15 17:27:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:27:54,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:27:54,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:27:54,722 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 17:27:54,723 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 17:27:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:27:54,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 84 conjunts are in the unsatisfiable core [2022-03-15 17:27:54,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:27:55,139 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 19 treesize of output 15 [2022-03-15 17:27:55,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:27:55,486 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 51 treesize of output 38 [2022-03-15 17:27:56,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:27:56,085 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 46 [2022-03-15 17:28:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:28:26,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:28:58,351 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:28:58,351 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 68 treesize of output 57 [2022-03-15 17:28:58,361 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:28:58,361 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 57 treesize of output 59 [2022-03-15 17:28:58,371 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 10 treesize of output 4 [2022-03-15 17:28:58,388 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:28:58,388 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 79 treesize of output 76 [2022-03-15 17:28:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:28:58,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657916006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:28:58,802 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:28:58,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2022-03-15 17:28:58,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006745084] [2022-03-15 17:28:58,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:28:58,806 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:28:58,819 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 104 transitions. [2022-03-15 17:28:58,819 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:28:59,606 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:28:59,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 17:28:59,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:28:59,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 17:28:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=3437, Unknown=34, NotChecked=0, Total=3906 [2022-03-15 17:28:59,608 INFO L87 Difference]: Start difference. First operand 865 states and 2020 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 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 17:29:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:29:01,691 INFO L93 Difference]: Finished difference Result 1417 states and 3158 transitions. [2022-03-15 17:29:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 17:29:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 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 36 [2022-03-15 17:29:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:29:01,696 INFO L225 Difference]: With dead ends: 1417 [2022-03-15 17:29:01,696 INFO L226 Difference]: Without dead ends: 1288 [2022-03-15 17:29:01,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 64.3s TimeCoverageRelationStatistics Valid=943, Invalid=6855, Unknown=34, NotChecked=0, Total=7832 [2022-03-15 17:29:01,699 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 17:29:01,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 2319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2267 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 17:29:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2022-03-15 17:29:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 962. [2022-03-15 17:29:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 2.357291666666667) internal successors, (2263), 961 states have internal predecessors, (2263), 0 states have call successors, (0), 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 17:29:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2263 transitions. [2022-03-15 17:29:01,723 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2263 transitions. Word has length 36 [2022-03-15 17:29:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:29:01,723 INFO L470 AbstractCegarLoop]: Abstraction has 962 states and 2263 transitions. [2022-03-15 17:29:01,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 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 17:29:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2263 transitions. [2022-03-15 17:29:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:29:01,725 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:29:01,725 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:29:01,759 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 17:29:01,940 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,SelfDestructingSolverStorable14 [2022-03-15 17:29:01,942 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:29:01,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:29:01,942 INFO L85 PathProgramCache]: Analyzing trace with hash -872676519, now seen corresponding path program 2 times [2022-03-15 17:29:01,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:29:01,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387946355] [2022-03-15 17:29:01,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:29:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:29:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:29:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:29:02,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:29:02,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387946355] [2022-03-15 17:29:02,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387946355] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:29:02,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70879049] [2022-03-15 17:29:02,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:29:02,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:29:02,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:29:02,583 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 17:29:02,586 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 17:29:02,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:29:02,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:29:02,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 17:29:02,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:29:02,747 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:29:02,748 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 17:29:03,047 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 19 treesize of output 15 [2022-03-15 17:29:03,214 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 42 treesize of output 38 [2022-03-15 17:29:03,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:29:03,579 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 51 treesize of output 38 [2022-03-15 17:29:04,349 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 78 treesize of output 46 [2022-03-15 17:29:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:29:04,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:29:39,515 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_660) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) is different from false [2022-03-15 17:29:39,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_660) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296)))) is different from false [2022-03-15 17:29:39,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_660) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:29:39,531 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:29:39,531 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 29 treesize of output 30 [2022-03-15 17:29:39,538 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:29:39,539 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 49 treesize of output 52 [2022-03-15 17:29:39,542 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 22 [2022-03-15 17:29:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 17:29:39,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70879049] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:29:39,819 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:29:39,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 62 [2022-03-15 17:29:39,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1891985565] [2022-03-15 17:29:39,819 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:29:39,823 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:29:39,835 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 88 transitions. [2022-03-15 17:29:39,835 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:29:40,502 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [29636#(and (<= 0 (* ~top~0 4)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (<= ~top~0 0)), 29635#(and (<= 0 (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0))] [2022-03-15 17:29:40,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 17:29:40,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:29:40,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 17:29:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=3627, Unknown=22, NotChecked=372, Total=4290 [2022-03-15 17:29:40,503 INFO L87 Difference]: Start difference. First operand 962 states and 2263 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 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 17:29:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:29:43,434 INFO L93 Difference]: Finished difference Result 1665 states and 3720 transitions. [2022-03-15 17:29:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 17:29:43,434 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 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 17:29:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:29:43,439 INFO L225 Difference]: With dead ends: 1665 [2022-03-15 17:29:43,439 INFO L226 Difference]: Without dead ends: 1556 [2022-03-15 17:29:43,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2392 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=670, Invalid=7330, Unknown=22, NotChecked=534, Total=8556 [2022-03-15 17:29:43,441 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 245 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:29:43,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 0 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 17:29:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2022-03-15 17:29:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1086. [2022-03-15 17:29:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1084 states have (on average 2.3690036900369003) internal successors, (2568), 1085 states have internal predecessors, (2568), 0 states have call successors, (0), 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 17:29:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 2568 transitions. [2022-03-15 17:29:43,466 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 2568 transitions. Word has length 36 [2022-03-15 17:29:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:29:43,467 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 2568 transitions. [2022-03-15 17:29:43,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 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 17:29:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 2568 transitions. [2022-03-15 17:29:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:29:43,468 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:29:43,468 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:29:43,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 17:29:43,678 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,SelfDestructingSolverStorable15 [2022-03-15 17:29:43,679 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:29:43,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:29:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2050345407, now seen corresponding path program 3 times [2022-03-15 17:29:43,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:29:43,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191691238] [2022-03-15 17:29:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:29:43,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:29:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:29:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:29:44,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:29:44,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191691238] [2022-03-15 17:29:44,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191691238] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:29:44,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003425258] [2022-03-15 17:29:44,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:29:44,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:29:44,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:29:44,460 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 17:29:44,460 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 17:29:44,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 17:29:44,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:29:44,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 99 conjunts are in the unsatisfiable core [2022-03-15 17:29:44,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:29:44,601 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 17:29:44,602 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 17:29:44,896 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 19 treesize of output 15 [2022-03-15 17:29:45,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:29:45,301 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 51 treesize of output 38 [2022-03-15 17:29:45,439 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 42 treesize of output 38 [2022-03-15 17:29:46,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 17:29:46,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 46 [2022-03-15 17:30:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:30:26,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:30:29,561 INFO L353 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2022-03-15 17:30:29,561 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 2 case distinctions, treesize of input 55 treesize of output 63 [2022-03-15 17:30:29,570 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:30:29,570 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 70 treesize of output 73 [2022-03-15 17:30:29,574 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 29 treesize of output 22 [2022-03-15 17:30:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:30:30,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003425258] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:30:30,064 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:30:30,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 69 [2022-03-15 17:30:30,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [692721945] [2022-03-15 17:30:30,065 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:30:30,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:30:30,077 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 54 transitions. [2022-03-15 17:30:30,077 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:30:30,250 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [33809#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)))] [2022-03-15 17:30:30,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 17:30:30,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:30:30,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 17:30:30,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=4494, Unknown=89, NotChecked=0, Total=5112 [2022-03-15 17:30:30,252 INFO L87 Difference]: Start difference. First operand 1086 states and 2568 transitions. Second operand has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 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 17:30:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:30:33,306 INFO L93 Difference]: Finished difference Result 1670 states and 3716 transitions. [2022-03-15 17:30:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 17:30:33,306 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 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 17:30:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:30:33,311 INFO L225 Difference]: With dead ends: 1670 [2022-03-15 17:30:33,311 INFO L226 Difference]: Without dead ends: 1540 [2022-03-15 17:30:33,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3066 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=1215, Invalid=8596, Unknown=89, NotChecked=0, Total=9900 [2022-03-15 17:30:33,313 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 327 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 2499 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:30:33,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 0 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2499 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 17:30:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2022-03-15 17:30:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 893. [2022-03-15 17:30:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 891 states have (on average 2.356902356902357) internal successors, (2100), 892 states have internal predecessors, (2100), 0 states have call successors, (0), 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 17:30:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 2100 transitions. [2022-03-15 17:30:33,332 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 2100 transitions. Word has length 36 [2022-03-15 17:30:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:30:33,333 INFO L470 AbstractCegarLoop]: Abstraction has 893 states and 2100 transitions. [2022-03-15 17:30:33,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 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 17:30:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 2100 transitions. [2022-03-15 17:30:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 17:30:33,334 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:30:33,334 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:30:33,358 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 17:30:33,558 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,SelfDestructingSolverStorable16 [2022-03-15 17:30:33,558 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:30:33,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:30:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1545239996, now seen corresponding path program 2 times [2022-03-15 17:30:33,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:30:33,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50077489] [2022-03-15 17:30:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:30:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:30:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:30:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:30:33,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:30:33,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50077489] [2022-03-15 17:30:33,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50077489] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:30:33,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225738404] [2022-03-15 17:30:33,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:30:33,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:30:33,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:30:33,688 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 17:30:33,719 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 17:30:33,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:30:33,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:30:33,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 17:30:33,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:30:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:30:33,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:30:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:30:34,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225738404] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:30:34,010 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:30:34,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-03-15 17:30:34,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941863010] [2022-03-15 17:30:34,010 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:30:34,015 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:30:34,039 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 134 transitions. [2022-03-15 17:30:34,039 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:30:34,293 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:30:34,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 17:30:34,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:30:34,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 17:30:34,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-15 17:30:34,294 INFO L87 Difference]: Start difference. First operand 893 states and 2100 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 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 17:30:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:30:34,510 INFO L93 Difference]: Finished difference Result 1266 states and 2842 transitions. [2022-03-15 17:30:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 17:30:34,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 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 38 [2022-03-15 17:30:34,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:30:34,516 INFO L225 Difference]: With dead ends: 1266 [2022-03-15 17:30:34,517 INFO L226 Difference]: Without dead ends: 1266 [2022-03-15 17:30:34,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:30:34,517 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:30:34,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:30:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-03-15 17:30:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 955. [2022-03-15 17:30:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 953 states have (on average 2.3871983210912906) internal successors, (2275), 954 states have internal predecessors, (2275), 0 states have call successors, (0), 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 17:30:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 2275 transitions. [2022-03-15 17:30:34,540 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 2275 transitions. Word has length 38 [2022-03-15 17:30:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:30:34,541 INFO L470 AbstractCegarLoop]: Abstraction has 955 states and 2275 transitions. [2022-03-15 17:30:34,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 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 17:30:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 2275 transitions. [2022-03-15 17:30:34,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 17:30:34,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:30:34,543 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-03-15 17:30:34,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 17:30:34,778 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,SelfDestructingSolverStorable17 [2022-03-15 17:30:34,779 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:30:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:30:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1904132101, now seen corresponding path program 5 times [2022-03-15 17:30:34,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:30:34,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887959317] [2022-03-15 17:30:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:30:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:30:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:30:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 56 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:30:34,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:30:34,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887959317] [2022-03-15 17:30:34,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887959317] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:30:34,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682618622] [2022-03-15 17:30:34,843 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:30:34,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:30:34,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:30:34,860 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 17:30:34,862 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 17:30:35,008 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 17:30:35,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:30:35,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 17:30:35,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:30:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:30:35,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 17:30:35,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682618622] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:30:35,080 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 17:30:35,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2022-03-15 17:30:35,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1809219390] [2022-03-15 17:30:35,080 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:30:35,087 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:30:35,117 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 41 transitions. [2022-03-15 17:30:35,117 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:30:35,118 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:30:35,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:30:35,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:30:35,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:30:35,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:30:35,118 INFO L87 Difference]: Start difference. First operand 955 states and 2275 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 17:30:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:30:35,270 INFO L93 Difference]: Finished difference Result 1540 states and 3551 transitions. [2022-03-15 17:30:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:30:35,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-03-15 17:30:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:30:35,274 INFO L225 Difference]: With dead ends: 1540 [2022-03-15 17:30:35,274 INFO L226 Difference]: Without dead ends: 1282 [2022-03-15 17:30:35,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:30:35,276 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 105 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:30:35,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 16 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:30:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2022-03-15 17:30:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1064. [2022-03-15 17:30:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1062 states have (on average 2.0894538606403015) internal successors, (2219), 1063 states have internal predecessors, (2219), 0 states have call successors, (0), 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 17:30:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 2219 transitions. [2022-03-15 17:30:35,298 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 2219 transitions. Word has length 41 [2022-03-15 17:30:35,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:30:35,298 INFO L470 AbstractCegarLoop]: Abstraction has 1064 states and 2219 transitions. [2022-03-15 17:30:35,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 17:30:35,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 2219 transitions. [2022-03-15 17:30:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 17:30:35,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:30:35,302 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:30:35,319 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 17:30:35,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:30:35,515 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:30:35,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:30:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1835587589, now seen corresponding path program 6 times [2022-03-15 17:30:35,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:30:35,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815699363] [2022-03-15 17:30:35,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:30:35,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:30:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:30:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:30:36,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:30:36,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815699363] [2022-03-15 17:30:36,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815699363] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:30:36,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194084476] [2022-03-15 17:30:36,237 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:30:36,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:30:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:30:36,239 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 17:30:36,240 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 17:30:36,364 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 17:30:36,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:30:36,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 17:30:36,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:30:36,384 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 17:30:36,384 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 17:30:36,720 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 19 treesize of output 15 [2022-03-15 17:30:36,917 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 62 treesize of output 58 [2022-03-15 17:30:37,314 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 110 treesize of output 46 [2022-03-15 17:30:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-15 17:30:58,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:30:58,583 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_958) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ 4294967294 (* (div .cse0 4294967296) 4294967296)) .cse0)))) is different from false [2022-03-15 17:30:58,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_958) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296)))))) is different from false [2022-03-15 17:30:58,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_958) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= .cse0 (+ (* (div .cse0 4294967296) 4294967296) 4294967294))))) is different from false [2022-03-15 17:30:58,600 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:30:58,601 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 56 treesize of output 45 [2022-03-15 17:30:58,609 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:30:58,609 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 71 treesize of output 66 [2022-03-15 17:30:58,613 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 42 treesize of output 30 [2022-03-15 17:30:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 6 not checked. [2022-03-15 17:30:58,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194084476] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:30:58,939 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:30:58,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 47 [2022-03-15 17:30:58,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481805777] [2022-03-15 17:30:58,940 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:30:58,946 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:30:58,960 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 60 transitions. [2022-03-15 17:30:58,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:30:59,231 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [44842#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 12))) (<= (+ |~#m~0.offset| 12) (* ~top~0 4)) (= |~#arr~0.offset| 0) (<= (* ~top~0 4) (+ |~#m~0.offset| 12)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 12)) 4)), 44841#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 12))) (= |~#arr~0.offset| 0) (<= (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (+ |~#m~0.offset| 12)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#m~0.offset| 12)) 4) (<= (+ |~#m~0.offset| 12) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)))] [2022-03-15 17:30:59,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 17:30:59,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:30:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 17:30:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2088, Unknown=13, NotChecked=282, Total=2550 [2022-03-15 17:30:59,233 INFO L87 Difference]: Start difference. First operand 1064 states and 2219 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 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 17:31:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:31:01,718 INFO L93 Difference]: Finished difference Result 1218 states and 2507 transitions. [2022-03-15 17:31:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 17:31:01,718 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 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 42 [2022-03-15 17:31:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:31:01,722 INFO L225 Difference]: With dead ends: 1218 [2022-03-15 17:31:01,722 INFO L226 Difference]: Without dead ends: 1218 [2022-03-15 17:31:01,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=294, Invalid=3245, Unknown=13, NotChecked=354, Total=3906 [2022-03-15 17:31:01,724 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 3110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 17:31:01,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3110 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 17:31:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2022-03-15 17:31:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1042. [2022-03-15 17:31:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1040 states have (on average 2.081730769230769) internal successors, (2165), 1041 states have internal predecessors, (2165), 0 states have call successors, (0), 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 17:31:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 2165 transitions. [2022-03-15 17:31:01,768 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 2165 transitions. Word has length 42 [2022-03-15 17:31:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:31:01,768 INFO L470 AbstractCegarLoop]: Abstraction has 1042 states and 2165 transitions. [2022-03-15 17:31:01,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 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 17:31:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 2165 transitions. [2022-03-15 17:31:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 17:31:01,769 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:31:01,769 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:31:01,787 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 17:31:01,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:31:01,975 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:31:01,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:31:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2080273697, now seen corresponding path program 4 times [2022-03-15 17:31:01,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:31:01,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810534265] [2022-03-15 17:31:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:31:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:31:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:31:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:31:02,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:31:02,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810534265] [2022-03-15 17:31:02,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810534265] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:31:02,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704674014] [2022-03-15 17:31:02,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:31:02,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:31:02,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:31:02,607 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 17:31:02,608 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 17:31:02,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:31:02,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:31:02,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 17:31:02,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:31:03,059 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 19 treesize of output 15 [2022-03-15 17:31:03,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:31:03,495 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 59 treesize of output 40 [2022-03-15 17:31:04,503 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 78 treesize of output 46 [2022-03-15 17:31:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:31:40,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:31:53,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1031 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_99| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_238| Int)) (or (not (let ((.cse0 (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_238|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_99|) v_ArrVal_1031)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ 4294967294 (* 4294967296 (div .cse0 4294967296))) .cse0))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_99|)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_238| c_~top~0))) is different from false [2022-03-15 17:32:04,088 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 70 treesize of output 54 [2022-03-15 17:32:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 17:32:04,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704674014] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:32:04,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:32:04,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 19] total 61 [2022-03-15 17:32:04,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [141530970] [2022-03-15 17:32:04,304 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:32:04,310 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:32:04,333 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 139 transitions. [2022-03-15 17:32:04,333 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:32:05,359 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:32:05,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 17:32:05,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:32:05,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 17:32:05,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3429, Unknown=24, NotChecked=118, Total=3782 [2022-03-15 17:32:05,360 INFO L87 Difference]: Start difference. First operand 1042 states and 2165 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 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 17:32:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:32:08,258 INFO L93 Difference]: Finished difference Result 1716 states and 3573 transitions. [2022-03-15 17:32:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 17:32:08,260 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 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 43 [2022-03-15 17:32:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:32:08,264 INFO L225 Difference]: With dead ends: 1716 [2022-03-15 17:32:08,264 INFO L226 Difference]: Without dead ends: 1676 [2022-03-15 17:32:08,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=488, Invalid=6802, Unknown=24, NotChecked=168, Total=7482 [2022-03-15 17:32:08,265 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 3560 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 17:32:08,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 3599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3560 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 17:32:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-03-15 17:32:08,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1346. [2022-03-15 17:32:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1344 states have (on average 2.087797619047619) internal successors, (2806), 1345 states have internal predecessors, (2806), 0 states have call successors, (0), 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 17:32:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2806 transitions. [2022-03-15 17:32:08,291 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2806 transitions. Word has length 43 [2022-03-15 17:32:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:32:08,292 INFO L470 AbstractCegarLoop]: Abstraction has 1346 states and 2806 transitions. [2022-03-15 17:32:08,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 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 17:32:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2806 transitions. [2022-03-15 17:32:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 17:32:08,294 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:32:08,294 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:32:08,313 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 17:32:08,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:32:08,514 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:32:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:32:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash 770149921, now seen corresponding path program 5 times [2022-03-15 17:32:08,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:32:08,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19174370] [2022-03-15 17:32:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:32:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:32:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:32:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 17:32:09,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:32:09,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19174370] [2022-03-15 17:32:09,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19174370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:32:09,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321988048] [2022-03-15 17:32:09,032 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:32:09,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:32:09,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:32:09,033 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 17:32:09,047 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 17:32:09,189 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 17:32:09,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:32:09,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 17:32:09,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:32:09,388 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 19 treesize of output 15 [2022-03-15 17:32:09,723 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 110 treesize of output 46 [2022-03-15 17:32:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:32:09,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:32:10,131 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 70 treesize of output 54 [2022-03-15 17:32:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:32:10,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321988048] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 17:32:10,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 17:32:10,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18, 13] total 42 [2022-03-15 17:32:10,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [885140750] [2022-03-15 17:32:10,317 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:32:10,328 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:32:10,344 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 83 transitions. [2022-03-15 17:32:10,344 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:32:10,367 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:32:10,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 17:32:10,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:32:10,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 17:32:10,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1681, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 17:32:10,368 INFO L87 Difference]: Start difference. First operand 1346 states and 2806 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:32:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:32:11,307 INFO L93 Difference]: Finished difference Result 2476 states and 4957 transitions. [2022-03-15 17:32:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 17:32:11,307 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 43 [2022-03-15 17:32:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:32:11,311 INFO L225 Difference]: With dead ends: 2476 [2022-03-15 17:32:11,311 INFO L226 Difference]: Without dead ends: 2305 [2022-03-15 17:32:11,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 17:32:11,312 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 71 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 17:32:11,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 7 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 796 Invalid, 0 Unknown, 288 Unchecked, 0.6s Time] [2022-03-15 17:32:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2022-03-15 17:32:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 1389. [2022-03-15 17:32:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1387 states have (on average 2.0108147080028838) internal successors, (2789), 1388 states have internal predecessors, (2789), 0 states have call successors, (0), 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 17:32:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2789 transitions. [2022-03-15 17:32:11,341 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2789 transitions. Word has length 43 [2022-03-15 17:32:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:32:11,341 INFO L470 AbstractCegarLoop]: Abstraction has 1389 states and 2789 transitions. [2022-03-15 17:32:11,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:32:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2789 transitions. [2022-03-15 17:32:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 17:32:11,343 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:32:11,343 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:32:11,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 17:32:11,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 17:32:11,550 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:32:11,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:32:11,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2128997279, now seen corresponding path program 6 times [2022-03-15 17:32:11,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:32:11,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240615428] [2022-03-15 17:32:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:32:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:32:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:32:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:32:12,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:32:12,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240615428] [2022-03-15 17:32:12,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240615428] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:32:12,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251322648] [2022-03-15 17:32:12,315 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:32:12,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:32:12,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:32:12,316 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 17:32:12,318 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 17:32:12,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 17:32:12,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:32:12,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 98 conjunts are in the unsatisfiable core [2022-03-15 17:32:12,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:32:12,500 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:32:12,500 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 17:32:12,779 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 17:32:12,939 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 29 treesize of output 29 [2022-03-15 17:32:13,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:32:13,240 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 38 treesize of output 29 [2022-03-15 17:32:13,881 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 69 treesize of output 33 [2022-03-15 17:32:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:32:13,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:32:14,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1178) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ (* (div .cse0 4294967296) 4294967296) 4294967294))))) is different from false [2022-03-15 17:32:14,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1178) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0)))) is different from false [2022-03-15 17:32:14,716 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1178) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0)))) is different from false [2022-03-15 17:32:14,721 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:32:14,721 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 56 treesize of output 45 [2022-03-15 17:32:14,730 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:32:14,730 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 71 treesize of output 66 [2022-03-15 17:32:14,733 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 42 treesize of output 30 [2022-03-15 17:32:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-03-15 17:32:14,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251322648] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:32:14,967 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:32:14,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 20] total 60 [2022-03-15 17:32:14,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [60262358] [2022-03-15 17:32:14,967 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:32:14,973 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:32:14,989 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 95 transitions. [2022-03-15 17:32:14,989 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:32:15,507 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [58831#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 4) 4) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) (<= 1 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 4))), 58832#(and (<= 1 ~top~0) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 4) 4) (<= ~top~0 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 4)))] [2022-03-15 17:32:15,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 17:32:15,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:32:15,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 17:32:15,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3438, Unknown=3, NotChecked=360, Total=4032 [2022-03-15 17:32:15,508 INFO L87 Difference]: Start difference. First operand 1389 states and 2789 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 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 17:32:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:32:17,769 INFO L93 Difference]: Finished difference Result 1940 states and 3894 transitions. [2022-03-15 17:32:17,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 17:32:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 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 43 [2022-03-15 17:32:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:32:17,773 INFO L225 Difference]: With dead ends: 1940 [2022-03-15 17:32:17,773 INFO L226 Difference]: Without dead ends: 1940 [2022-03-15 17:32:17,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=501, Invalid=6648, Unknown=3, NotChecked=504, Total=7656 [2022-03-15 17:32:17,781 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 192 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 3104 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:32:17,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 0 Invalid, 3155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3104 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 17:32:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2022-03-15 17:32:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1446. [2022-03-15 17:32:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1444 states have (on average 2.0422437673130194) internal successors, (2949), 1445 states have internal predecessors, (2949), 0 states have call successors, (0), 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 17:32:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2949 transitions. [2022-03-15 17:32:17,817 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2949 transitions. Word has length 43 [2022-03-15 17:32:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:32:17,817 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 2949 transitions. [2022-03-15 17:32:17,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 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 17:32:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2949 transitions. [2022-03-15 17:32:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 17:32:17,819 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:32:17,819 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:32:17,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 17:32:18,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:32:18,036 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:32:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:32:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash 794024647, now seen corresponding path program 7 times [2022-03-15 17:32:18,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:32:18,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256590984] [2022-03-15 17:32:18,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:32:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:32:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:32:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:32:18,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:32:18,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256590984] [2022-03-15 17:32:18,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256590984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:32:18,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872664714] [2022-03-15 17:32:18,812 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 17:32:18,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:32:18,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:32:18,813 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 17:32:18,814 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 17:32:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:32:18,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 95 conjunts are in the unsatisfiable core [2022-03-15 17:32:18,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:32:18,970 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:32:18,970 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 17:32:19,346 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 19 treesize of output 15 [2022-03-15 17:32:19,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:32:19,846 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 59 treesize of output 40 [2022-03-15 17:32:20,017 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 50 treesize of output 46 [2022-03-15 17:32:20,853 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 78 treesize of output 46 [2022-03-15 17:33:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:33:01,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:33:01,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1256 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0)))) is different from false [2022-03-15 17:33:01,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1256 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset| (- 4))))) (= .cse0 (+ (* (div .cse0 4294967296) 4294967296) 4294967294))))) is different from false [2022-03-15 17:33:01,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1256 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ 4294967294 (* (div .cse0 4294967296) 4294967296)) .cse0)))) is different from false [2022-03-15 17:33:01,976 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1254 Int) (v_ArrVal_1256 (Array Int Int))) (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1254)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296))))))) is different from false [2022-03-15 17:33:01,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_286| Int) (v_ArrVal_1254 Int) (v_ArrVal_1256 (Array Int Int))) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_286|)) v_ArrVal_1254)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ 4294967294 (* 4294967296 (div .cse0 4294967296))) .cse0))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_286| c_~top~0))) is different from false [2022-03-15 17:33:02,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_286| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_115| Int) (v_ArrVal_1254 Int) (v_ArrVal_1256 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_286| c_~top~0) (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_115| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_286|)) v_ArrVal_1254)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_115|)))) is different from false [2022-03-15 17:33:02,069 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_286| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_115| Int) (v_ArrVal_1254 Int) (v_ArrVal_1256 (Array Int Int))) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_115| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_286|)) v_ArrVal_1254)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) 4294967294)))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_115| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_286| c_~top~0))) is different from false [2022-03-15 17:33:02,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_286| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_115| Int) (v_ArrVal_1254 Int) (v_ArrVal_1256 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_115| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_286| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_115| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_286|)) v_ArrVal_1254)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0))))) is different from false [2022-03-15 17:33:02,163 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_286| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_115| Int) (v_ArrVal_1254 Int) (v_ArrVal_1256 (Array Int Int))) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_115| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_286| (+ c_~top~0 1)) (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_115| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_286|)) v_ArrVal_1254)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296))))))) is different from false [2022-03-15 17:33:02,191 INFO L353 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-03-15 17:33:02,191 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 2 case distinctions, treesize of input 104 treesize of output 75 [2022-03-15 17:33:02,200 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:33:02,200 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 89 treesize of output 84 [2022-03-15 17:33:02,206 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 42 treesize of output 30 [2022-03-15 17:33:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 16 not checked. [2022-03-15 17:33:02,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872664714] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:33:02,505 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:33:02,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 22] total 71 [2022-03-15 17:33:02,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1999439050] [2022-03-15 17:33:02,505 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:02,510 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:02,524 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 61 transitions. [2022-03-15 17:33:02,524 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:02,722 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [64038#(and (= |~#arr~0.offset| 0) (<= 2 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= (select (select |#memory_int| |~#arr~0.base|) 4) 4) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 2) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 4)))] [2022-03-15 17:33:02,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 17:33:02,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:02,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 17:33:02,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3884, Unknown=29, NotChecked=1206, Total=5402 [2022-03-15 17:33:02,724 INFO L87 Difference]: Start difference. First operand 1446 states and 2949 transitions. Second operand has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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 17:33:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:07,190 INFO L93 Difference]: Finished difference Result 2126 states and 4285 transitions. [2022-03-15 17:33:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 17:33:07,190 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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 43 [2022-03-15 17:33:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:07,194 INFO L225 Difference]: With dead ends: 2126 [2022-03-15 17:33:07,194 INFO L226 Difference]: Without dead ends: 2086 [2022-03-15 17:33:07,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2721 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=673, Invalid=9036, Unknown=29, NotChecked=1818, Total=11556 [2022-03-15 17:33:07,195 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 4763 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:07,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 4815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4763 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 17:33:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2022-03-15 17:33:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1268. [2022-03-15 17:33:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1266 states have (on average 1.9834123222748816) internal successors, (2511), 1267 states have internal predecessors, (2511), 0 states have call successors, (0), 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 17:33:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2511 transitions. [2022-03-15 17:33:07,213 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2511 transitions. Word has length 43 [2022-03-15 17:33:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:07,213 INFO L470 AbstractCegarLoop]: Abstraction has 1268 states and 2511 transitions. [2022-03-15 17:33:07,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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 17:33:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2511 transitions. [2022-03-15 17:33:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 17:33:07,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:07,215 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:33:07,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 17:33:07,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:07,432 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash -778524521, now seen corresponding path program 1 times [2022-03-15 17:33:07,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:07,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55673725] [2022-03-15 17:33:07,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 17:33:07,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:07,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55673725] [2022-03-15 17:33:07,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55673725] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:33:07,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923068706] [2022-03-15 17:33:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:07,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:07,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:33:07,905 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 17:33:07,909 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 17:33:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:08,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 17:33:08,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:33:08,313 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 19 treesize of output 15 [2022-03-15 17:33:08,708 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 110 treesize of output 46 [2022-03-15 17:33:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:33:28,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:33:28,531 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 70 treesize of output 54 [2022-03-15 17:33:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:33:28,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923068706] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 17:33:28,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 17:33:28,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18, 13] total 42 [2022-03-15 17:33:28,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [440216589] [2022-03-15 17:33:28,744 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:28,750 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:28,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 96 transitions. [2022-03-15 17:33:28,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:28,867 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:28,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 17:33:28,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 17:33:28,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1670, Unknown=9, NotChecked=0, Total=1806 [2022-03-15 17:33:28,868 INFO L87 Difference]: Start difference. First operand 1268 states and 2511 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 17:33:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:30,225 INFO L93 Difference]: Finished difference Result 1951 states and 3823 transitions. [2022-03-15 17:33:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 17:33:30,225 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 44 [2022-03-15 17:33:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:30,228 INFO L225 Difference]: With dead ends: 1951 [2022-03-15 17:33:30,228 INFO L226 Difference]: Without dead ends: 1826 [2022-03-15 17:33:30,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=173, Invalid=2574, Unknown=9, NotChecked=0, Total=2756 [2022-03-15 17:33:30,228 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:30,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 7 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 796 Invalid, 0 Unknown, 292 Unchecked, 0.6s Time] [2022-03-15 17:33:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2022-03-15 17:33:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1009. [2022-03-15 17:33:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1007 states have (on average 2.0526315789473686) internal successors, (2067), 1008 states have internal predecessors, (2067), 0 states have call successors, (0), 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 17:33:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 2067 transitions. [2022-03-15 17:33:30,253 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 2067 transitions. Word has length 44 [2022-03-15 17:33:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:30,253 INFO L470 AbstractCegarLoop]: Abstraction has 1009 states and 2067 transitions. [2022-03-15 17:33:30,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 17:33:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 2067 transitions. [2022-03-15 17:33:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 17:33:30,255 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:30,255 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:33:30,271 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 17:33:30,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:30,457 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:30,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1137946974, now seen corresponding path program 3 times [2022-03-15 17:33:30,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:30,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117064371] [2022-03-15 17:33:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:30,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:33:30,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:30,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117064371] [2022-03-15 17:33:30,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117064371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:33:30,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511821086] [2022-03-15 17:33:30,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:33:30,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:30,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:33:30,564 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 17:33:30,567 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 17:33:30,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 17:33:30,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:33:30,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 17:33:30,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:33:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-03-15 17:33:30,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 17:33:30,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511821086] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:33:30,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 17:33:30,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2022-03-15 17:33:30,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23209551] [2022-03-15 17:33:30,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:30,810 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:30,860 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 169 transitions. [2022-03-15 17:33:30,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:31,033 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:31,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:33:31,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:31,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:33:31,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-15 17:33:31,034 INFO L87 Difference]: Start difference. First operand 1009 states and 2067 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:33:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:31,196 INFO L93 Difference]: Finished difference Result 1301 states and 2659 transitions. [2022-03-15 17:33:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:33:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 45 [2022-03-15 17:33:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:31,199 INFO L225 Difference]: With dead ends: 1301 [2022-03-15 17:33:31,199 INFO L226 Difference]: Without dead ends: 1297 [2022-03-15 17:33:31,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-03-15 17:33:31,199 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:31,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:33:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-03-15 17:33:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 995. [2022-03-15 17:33:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 993 states have (on average 2.0463242698892246) internal successors, (2032), 994 states have internal predecessors, (2032), 0 states have call successors, (0), 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 17:33:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2032 transitions. [2022-03-15 17:33:31,213 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2032 transitions. Word has length 45 [2022-03-15 17:33:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:31,213 INFO L470 AbstractCegarLoop]: Abstraction has 995 states and 2032 transitions. [2022-03-15 17:33:31,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:33:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2032 transitions. [2022-03-15 17:33:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 17:33:31,214 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:31,214 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:33:31,233 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 17:33:31,423 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,SelfDestructingSolverStorable25 [2022-03-15 17:33:31,423 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1404198042, now seen corresponding path program 4 times [2022-03-15 17:33:31,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:31,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179282810] [2022-03-15 17:33:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:33:31,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:31,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179282810] [2022-03-15 17:33:31,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179282810] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:33:31,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275693370] [2022-03-15 17:33:31,587 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:33:31,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:31,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:33:31,604 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 17:33:31,643 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 17:33:31,769 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:33:31,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:33:31,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 17:33:31,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:33:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:33:31,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:33:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:33:31,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275693370] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:33:31,978 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:33:31,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 15 [2022-03-15 17:33:31,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175096721] [2022-03-15 17:33:31,978 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:31,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:32,003 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 85 transitions. [2022-03-15 17:33:32,003 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:32,099 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:32,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 17:33:32,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 17:33:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-15 17:33:32,101 INFO L87 Difference]: Start difference. First operand 995 states and 2032 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 17:33:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:32,342 INFO L93 Difference]: Finished difference Result 1223 states and 2443 transitions. [2022-03-15 17:33:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 17:33:32,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 45 [2022-03-15 17:33:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:32,344 INFO L225 Difference]: With dead ends: 1223 [2022-03-15 17:33:32,345 INFO L226 Difference]: Without dead ends: 1177 [2022-03-15 17:33:32,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-03-15 17:33:32,345 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:32,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:33:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-03-15 17:33:32,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 967. [2022-03-15 17:33:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 965 states have (on average 2.0310880829015545) internal successors, (1960), 966 states have internal predecessors, (1960), 0 states have call successors, (0), 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 17:33:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1960 transitions. [2022-03-15 17:33:32,357 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1960 transitions. Word has length 45 [2022-03-15 17:33:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:32,357 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1960 transitions. [2022-03-15 17:33:32,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 17:33:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1960 transitions. [2022-03-15 17:33:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 17:33:32,358 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:32,358 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:33:32,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 17:33:32,567 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,SelfDestructingSolverStorable26 [2022-03-15 17:33:32,568 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:32,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1784042243, now seen corresponding path program 7 times [2022-03-15 17:33:32,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:32,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418537816] [2022-03-15 17:33:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:33:33,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:33,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418537816] [2022-03-15 17:33:33,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418537816] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:33:33,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850560536] [2022-03-15 17:33:33,262 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 17:33:33,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:33,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:33:33,263 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 17:33:33,264 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 17:33:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:33,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 17:33:33,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:33:33,447 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:33:33,447 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 17:33:33,837 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 19 treesize of output 15 [2022-03-15 17:33:34,034 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 62 treesize of output 58 [2022-03-15 17:33:34,449 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 110 treesize of output 46 [2022-03-15 17:33:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-03-15 17:33:34,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:33:34,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1582) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296)))))) is different from false [2022-03-15 17:33:34,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1582) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)))) (= .cse0 (+ (* (div .cse0 4294967296) 4294967296) 4294967294))))) is different from false [2022-03-15 17:33:34,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1582) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0)))) is different from false [2022-03-15 17:33:34,896 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:33:34,896 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 56 treesize of output 45 [2022-03-15 17:33:34,903 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:33:34,903 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 71 treesize of output 66 [2022-03-15 17:33:34,906 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 42 treesize of output 30 [2022-03-15 17:33:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 8 not checked. [2022-03-15 17:33:35,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850560536] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:33:35,209 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:33:35,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 14] total 48 [2022-03-15 17:33:35,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1311450357] [2022-03-15 17:33:35,209 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:35,216 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:35,235 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 67 transitions. [2022-03-15 17:33:35,235 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:35,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [80302#(and (= |~#arr~0.offset| 0) (<= ~top~0 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 16)) (<= 4 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) 16) 4)), 80301#(and (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 16)) (<= 4 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= (select (select |#memory_int| |~#arr~0.base|) 16) 4))] [2022-03-15 17:33:35,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 17:33:35,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:35,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 17:33:35,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2199, Unknown=3, NotChecked=288, Total=2652 [2022-03-15 17:33:35,540 INFO L87 Difference]: Start difference. First operand 967 states and 1960 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 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 17:33:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:38,100 INFO L93 Difference]: Finished difference Result 1172 states and 2353 transitions. [2022-03-15 17:33:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 17:33:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 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 49 [2022-03-15 17:33:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:38,103 INFO L225 Difference]: With dead ends: 1172 [2022-03-15 17:33:38,103 INFO L226 Difference]: Without dead ends: 1172 [2022-03-15 17:33:38,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=289, Invalid=3626, Unknown=3, NotChecked=372, Total=4290 [2022-03-15 17:33:38,104 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 3683 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:38,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 3697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3683 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 17:33:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2022-03-15 17:33:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 866. [2022-03-15 17:33:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 2.0277777777777777) internal successors, (1752), 865 states have internal predecessors, (1752), 0 states have call successors, (0), 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 17:33:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1752 transitions. [2022-03-15 17:33:38,115 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1752 transitions. Word has length 49 [2022-03-15 17:33:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:38,116 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1752 transitions. [2022-03-15 17:33:38,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 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 17:33:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1752 transitions. [2022-03-15 17:33:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 17:33:38,117 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:38,117 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:33:38,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 17:33:38,317 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,SelfDestructingSolverStorable27 [2022-03-15 17:33:38,318 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:38,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1686227265, now seen corresponding path program 8 times [2022-03-15 17:33:38,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:38,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972319452] [2022-03-15 17:33:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:33:39,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:39,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972319452] [2022-03-15 17:33:39,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972319452] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:33:39,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275263823] [2022-03-15 17:33:39,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:33:39,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:39,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:33:39,096 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 17:33:39,098 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 17:33:39,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:33:39,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:33:39,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 17:33:39,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:33:39,543 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 19 treesize of output 15 [2022-03-15 17:33:39,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:33:39,986 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 71 treesize of output 43 [2022-03-15 17:33:40,679 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 110 treesize of output 46 [2022-03-15 17:33:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:33:40,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:34:13,782 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 70 treesize of output 54 [2022-03-15 17:34:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:34:14,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275263823] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:34:14,028 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:34:14,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 19] total 60 [2022-03-15 17:34:14,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941882314] [2022-03-15 17:34:14,028 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:14,034 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:14,069 INFO L252 McrAutomatonBuilder]: Finished intersection with 113 states and 174 transitions. [2022-03-15 17:34:14,069 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:15,235 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:15,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 17:34:15,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:15,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 17:34:15,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3454, Unknown=14, NotChecked=0, Total=3660 [2022-03-15 17:34:15,237 INFO L87 Difference]: Start difference. First operand 866 states and 1752 transitions. Second operand has 26 states, 25 states have (on average 3.2) internal successors, (80), 25 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 17:34:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:17,970 INFO L93 Difference]: Finished difference Result 1183 states and 2407 transitions. [2022-03-15 17:34:17,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 17:34:17,971 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 25 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 50 [2022-03-15 17:34:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:17,988 INFO L225 Difference]: With dead ends: 1183 [2022-03-15 17:34:17,988 INFO L226 Difference]: Without dead ends: 1183 [2022-03-15 17:34:17,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 119 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=363, Invalid=5785, Unknown=14, NotChecked=0, Total=6162 [2022-03-15 17:34:17,994 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 3488 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:17,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 3505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3488 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 17:34:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-03-15 17:34:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 951. [2022-03-15 17:34:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 949 states have (on average 2.0579557428872497) internal successors, (1953), 950 states have internal predecessors, (1953), 0 states have call successors, (0), 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 17:34:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1953 transitions. [2022-03-15 17:34:18,007 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1953 transitions. Word has length 50 [2022-03-15 17:34:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:18,007 INFO L470 AbstractCegarLoop]: Abstraction has 951 states and 1953 transitions. [2022-03-15 17:34:18,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 25 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 17:34:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1953 transitions. [2022-03-15 17:34:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 17:34:18,008 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:18,008 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:18,041 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 17:34:18,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:18,227 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1589622183, now seen corresponding path program 9 times [2022-03-15 17:34:18,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:18,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268156919] [2022-03-15 17:34:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:18,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:19,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:19,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268156919] [2022-03-15 17:34:19,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268156919] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:19,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116288813] [2022-03-15 17:34:19,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:34:19,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:19,018 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 17:34:19,019 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 17:34:19,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 17:34:19,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:34:19,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 87 conjunts are in the unsatisfiable core [2022-03-15 17:34:19,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:19,208 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:34:19,208 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 17:34:19,536 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 19 treesize of output 15 [2022-03-15 17:34:19,747 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 62 treesize of output 58 [2022-03-15 17:34:20,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:34:20,085 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 71 treesize of output 43 [2022-03-15 17:34:20,922 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 110 treesize of output 46 [2022-03-15 17:34:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:34:56,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:35:42,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1754) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0)))) is different from false [2022-03-15 17:35:42,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1754) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)))) (= (+ 4294967294 (* (div .cse0 4294967296) 4294967296)) .cse0)))) is different from false [2022-03-15 17:35:42,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1754) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0)))) is different from false [2022-03-15 17:35:42,356 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:35:42,357 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 56 treesize of output 45 [2022-03-15 17:35:42,365 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:35:42,365 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 71 treesize of output 66 [2022-03-15 17:35:42,369 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 42 treesize of output 30 [2022-03-15 17:35:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 6 not checked. [2022-03-15 17:35:42,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116288813] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:35:42,752 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:35:42,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 20] total 64 [2022-03-15 17:35:42,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1524501863] [2022-03-15 17:35:42,752 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:35:42,758 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:35:42,779 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 102 transitions. [2022-03-15 17:35:42,780 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:35:43,675 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [87071#(and (<= (+ |~#arr~0.offset| 8) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (<= (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (+ |~#arr~0.offset| 8)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8)) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8)))), 87072#(and (= |~#arr~0.offset| 0) (<= (* ~top~0 4) (+ |~#arr~0.offset| 8)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8)) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8))) (<= (+ |~#arr~0.offset| 8) (* ~top~0 4)))] [2022-03-15 17:35:43,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 17:35:43,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:35:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 17:35:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3925, Unknown=40, NotChecked=384, Total=4556 [2022-03-15 17:35:43,676 INFO L87 Difference]: Start difference. First operand 951 states and 1953 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 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 17:35:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:35:47,812 INFO L93 Difference]: Finished difference Result 1319 states and 2685 transitions. [2022-03-15 17:35:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 17:35:47,812 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 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 50 [2022-03-15 17:35:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:35:47,814 INFO L225 Difference]: With dead ends: 1319 [2022-03-15 17:35:47,814 INFO L226 Difference]: Without dead ends: 1319 [2022-03-15 17:35:47,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 84.9s TimeCoverageRelationStatistics Valid=412, Invalid=6870, Unknown=40, NotChecked=510, Total=7832 [2022-03-15 17:35:47,815 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 184 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 17:35:47,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 0 Invalid, 3787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 17:35:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-03-15 17:35:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 916. [2022-03-15 17:35:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 2.0470459518599564) internal successors, (1871), 915 states have internal predecessors, (1871), 0 states have call successors, (0), 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 17:35:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1871 transitions. [2022-03-15 17:35:47,826 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1871 transitions. Word has length 50 [2022-03-15 17:35:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:35:47,826 INFO L470 AbstractCegarLoop]: Abstraction has 916 states and 1871 transitions. [2022-03-15 17:35:47,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 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 17:35:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1871 transitions. [2022-03-15 17:35:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 17:35:47,827 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:35:47,828 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:35:47,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 17:35:48,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:35:48,044 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:35:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:35:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1333399743, now seen corresponding path program 10 times [2022-03-15 17:35:48,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:35:48,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980198941] [2022-03-15 17:35:48,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:35:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:35:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:35:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:35:49,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:35:49,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980198941] [2022-03-15 17:35:49,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980198941] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:35:49,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663241248] [2022-03-15 17:35:49,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:35:49,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:35:49,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:35:49,189 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 17:35:49,190 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 17:35:49,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:35:49,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:35:49,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 17:35:49,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:35:49,379 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:35:49,380 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 17:35:49,726 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 19 treesize of output 15 [2022-03-15 17:35:50,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:35:50,234 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 71 treesize of output 43 [2022-03-15 17:35:50,442 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 62 treesize of output 58 [2022-03-15 17:35:51,318 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 110 treesize of output 46 [2022-03-15 17:35:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 17:35:51,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:35:52,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1844) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0)))) is different from false [2022-03-15 17:35:52,120 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1844) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset| (- 4))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0)))) is different from false [2022-03-15 17:35:52,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1844) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ 4294967294 (* (div .cse0 4294967296) 4294967296)) .cse0)))) is different from false [2022-03-15 17:35:52,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1842 Int)) (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1842)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1844) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0)))) is different from false [2022-03-15 17:35:52,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1842 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_404| Int)) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_404|)) v_ArrVal_1842)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1844) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296)))))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_404| c_~top~0))) is different from false [2022-03-15 17:35:52,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_155| Int) (v_ArrVal_1842 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_404| Int)) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_155| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_404|)) v_ArrVal_1842)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1844) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* 4294967296 (div .cse0 4294967296)))))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_155|)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_404| c_~top~0))) is different from false [2022-03-15 17:35:52,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_155| Int) (v_ArrVal_1842 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_404| Int)) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_155| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_404|)) v_ArrVal_1842)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1844) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296))))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_155| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_404| c_~top~0))) is different from false [2022-03-15 17:35:52,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_155| Int) (v_ArrVal_1842 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_404| Int)) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_155| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_404|)) v_ArrVal_1842)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1844) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296))))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_404| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_155| |c_~#arr~0.offset|))) is different from false [2022-03-15 17:35:52,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_155| Int) (v_ArrVal_1842 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_404| Int)) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_155| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_404|)) v_ArrVal_1842)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1844) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296))))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_155| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_404| (+ c_~top~0 1)))) is different from false [2022-03-15 17:35:52,431 INFO L353 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-03-15 17:35:52,431 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 2 case distinctions, treesize of input 104 treesize of output 75 [2022-03-15 17:35:52,442 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:35:52,443 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 89 treesize of output 84 [2022-03-15 17:35:52,448 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 42 treesize of output 30 [2022-03-15 17:35:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 25 not checked. [2022-03-15 17:35:52,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663241248] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:35:52,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:35:52,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 22] total 72 [2022-03-15 17:35:52,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [902984547] [2022-03-15 17:35:52,865 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:35:52,870 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:35:52,888 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 68 transitions. [2022-03-15 17:35:52,888 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:35:53,167 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [90634#(and (<= (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (+ |~#arr~0.offset| 12)) (<= (+ |~#arr~0.offset| 12) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| 8)) 2147483647))] [2022-03-15 17:35:53,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 17:35:53,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:35:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 17:35:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4055, Unknown=9, NotChecked=1224, Total=5550 [2022-03-15 17:35:53,168 INFO L87 Difference]: Start difference. First operand 916 states and 1871 transitions. Second operand has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 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 17:35:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:35:57,834 INFO L93 Difference]: Finished difference Result 1275 states and 2578 transitions. [2022-03-15 17:35:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 17:35:57,834 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 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 50 [2022-03-15 17:35:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:35:57,836 INFO L225 Difference]: With dead ends: 1275 [2022-03-15 17:35:57,836 INFO L226 Difference]: Without dead ends: 1275 [2022-03-15 17:35:57,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=540, Invalid=8043, Unknown=9, NotChecked=1710, Total=10302 [2022-03-15 17:35:57,837 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 231 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 4050 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:35:57,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 0 Invalid, 4084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4050 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 17:35:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-03-15 17:35:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 910. [2022-03-15 17:35:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 2.041850220264317) internal successors, (1854), 909 states have internal predecessors, (1854), 0 states have call successors, (0), 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 17:35:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1854 transitions. [2022-03-15 17:35:57,848 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1854 transitions. Word has length 50 [2022-03-15 17:35:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:35:57,848 INFO L470 AbstractCegarLoop]: Abstraction has 910 states and 1854 transitions. [2022-03-15 17:35:57,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 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 17:35:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1854 transitions. [2022-03-15 17:35:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 17:35:57,850 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:35:57,850 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:35:57,871 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 17:35:58,066 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,SelfDestructingSolverStorable30 [2022-03-15 17:35:58,067 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:35:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:35:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2037176293, now seen corresponding path program 11 times [2022-03-15 17:35:58,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:35:58,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539763247] [2022-03-15 17:35:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:35:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:35:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:35:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:35:59,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:35:59,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539763247] [2022-03-15 17:35:59,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539763247] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:35:59,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795510887] [2022-03-15 17:35:59,121 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:35:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:35:59,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:35:59,122 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 17:35:59,123 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 17:35:59,347 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 17:35:59,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:35:59,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 101 conjunts are in the unsatisfiable core [2022-03-15 17:35:59,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:35:59,723 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 19 treesize of output 15 [2022-03-15 17:36:00,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:36:00,151 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 51 treesize of output 38 [2022-03-15 17:36:00,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:36:00,554 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 51 treesize of output 38 [2022-03-15 17:36:01,567 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 78 treesize of output 46 [2022-03-15 17:36:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:36:50,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:37:23,051 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 70 treesize of output 54 [2022-03-15 17:37:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:37:23,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795510887] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:37:23,369 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:37:23,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 25] total 79 [2022-03-15 17:37:23,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361839776] [2022-03-15 17:37:23,370 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:37:23,375 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:37:23,439 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 147 transitions. [2022-03-15 17:37:23,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:37:24,761 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:37:24,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 17:37:24,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:37:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 17:37:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=5932, Unknown=31, NotChecked=0, Total=6320 [2022-03-15 17:37:24,762 INFO L87 Difference]: Start difference. First operand 910 states and 1854 transitions. Second operand has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 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 17:37:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:37:28,496 INFO L93 Difference]: Finished difference Result 1811 states and 3581 transitions. [2022-03-15 17:37:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 17:37:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 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 51 [2022-03-15 17:37:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:37:28,499 INFO L225 Difference]: With dead ends: 1811 [2022-03-15 17:37:28,499 INFO L226 Difference]: Without dead ends: 1476 [2022-03-15 17:37:28,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4135 ImplicationChecksByTransitivity, 85.5s TimeCoverageRelationStatistics Valid=842, Invalid=11559, Unknown=31, NotChecked=0, Total=12432 [2022-03-15 17:37:28,501 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:37:28,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 17:37:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2022-03-15 17:37:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1330. [2022-03-15 17:37:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1328 states have (on average 1.9887048192771084) internal successors, (2641), 1329 states have internal predecessors, (2641), 0 states have call successors, (0), 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 17:37:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2641 transitions. [2022-03-15 17:37:28,519 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 2641 transitions. Word has length 51 [2022-03-15 17:37:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:37:28,519 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 2641 transitions. [2022-03-15 17:37:28,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 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 17:37:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 2641 transitions. [2022-03-15 17:37:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 17:37:28,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:37:28,521 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:37:28,557 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 17:37:28,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-03-15 17:37:28,740 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:37:28,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:37:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1216828451, now seen corresponding path program 12 times [2022-03-15 17:37:28,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:37:28,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181198488] [2022-03-15 17:37:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:37:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:37:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:37:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 17:37:29,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:37:29,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181198488] [2022-03-15 17:37:29,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181198488] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:37:29,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427342017] [2022-03-15 17:37:29,743 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:37:29,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:37:29,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:37:29,744 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 17:37:29,746 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 17:37:29,945 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 17:37:29,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:37:29,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 113 conjunts are in the unsatisfiable core [2022-03-15 17:37:29,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:37:30,308 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 19 treesize of output 15 [2022-03-15 17:37:30,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:37:30,838 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 51 treesize of output 38 [2022-03-15 17:37:31,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:37:31,417 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 51 treesize of output 38 [2022-03-15 17:37:32,159 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 78 treesize of output 46 [2022-03-15 17:38:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 17:38:06,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:38:08,217 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 54 treesize of output 46 [2022-03-15 17:38:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 17:38:08,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427342017] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:38:08,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:38:08,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 19] total 65 [2022-03-15 17:38:08,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2046067571] [2022-03-15 17:38:08,453 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:38:08,459 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:38:08,486 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 119 transitions. [2022-03-15 17:38:08,486 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:38:09,491 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:38:09,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 17:38:09,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:38:09,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 17:38:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3990, Unknown=16, NotChecked=0, Total=4290 [2022-03-15 17:38:09,492 INFO L87 Difference]: Start difference. First operand 1330 states and 2641 transitions. Second operand has 29 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 0 states have call successors, (0), 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 17:38:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:38:13,065 INFO L93 Difference]: Finished difference Result 1824 states and 3620 transitions. [2022-03-15 17:38:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 17:38:13,065 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 0 states have call successors, (0), 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 51 [2022-03-15 17:38:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:38:13,068 INFO L225 Difference]: With dead ends: 1824 [2022-03-15 17:38:13,068 INFO L226 Difference]: Without dead ends: 1458 [2022-03-15 17:38:13,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 94 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=678, Invalid=7678, Unknown=16, NotChecked=0, Total=8372 [2022-03-15 17:38:13,069 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 232 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 17:38:13,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 0 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2885 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 17:38:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2022-03-15 17:38:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1356. [2022-03-15 17:38:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1354 states have (on average 1.9748892171344166) internal successors, (2674), 1355 states have internal predecessors, (2674), 0 states have call successors, (0), 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 17:38:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 2674 transitions. [2022-03-15 17:38:13,085 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 2674 transitions. Word has length 51 [2022-03-15 17:38:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:38:13,085 INFO L470 AbstractCegarLoop]: Abstraction has 1356 states and 2674 transitions. [2022-03-15 17:38:13,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 0 states have call successors, (0), 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 17:38:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 2674 transitions. [2022-03-15 17:38:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 17:38:13,087 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:38:13,087 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:38:13,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-15 17:38:13,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:38:13,304 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:38:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:38:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 456480331, now seen corresponding path program 13 times [2022-03-15 17:38:13,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:38:13,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50735901] [2022-03-15 17:38:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:38:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:38:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:38:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:38:14,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:38:14,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50735901] [2022-03-15 17:38:14,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50735901] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:38:14,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488820324] [2022-03-15 17:38:14,493 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 17:38:14,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:38:14,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:38:14,498 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 17:38:14,499 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 17:38:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:38:14,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 101 conjunts are in the unsatisfiable core [2022-03-15 17:38:14,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:38:14,700 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:38:14,701 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 17:38:15,054 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 19 treesize of output 15 [2022-03-15 17:38:15,320 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 42 treesize of output 38 [2022-03-15 17:38:15,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:38:15,710 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 51 treesize of output 38 [2022-03-15 17:38:16,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:38:16,163 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 51 treesize of output 38 [2022-03-15 17:38:17,316 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 78 treesize of output 46 [2022-03-15 17:38:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:38:17,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:38:37,176 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_2094 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2094) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) is different from false [2022-03-15 17:38:37,185 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0) (forall ((v_ArrVal_2094 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2094) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296))))) is different from false [2022-03-15 17:38:37,193 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_2094 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2094) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))))) is different from false [2022-03-15 17:38:37,202 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:38:37,203 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 29 treesize of output 30 [2022-03-15 17:38:37,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:38:37,212 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 49 treesize of output 52 [2022-03-15 17:38:37,216 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 22 [2022-03-15 17:38:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-03-15 17:38:37,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488820324] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:38:37,631 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:38:37,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 81 [2022-03-15 17:38:37,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2001226572] [2022-03-15 17:38:37,631 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:38:37,661 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:38:37,688 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 131 transitions. [2022-03-15 17:38:37,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:38:39,049 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [104037#(and (<= 0 (* ~top~0 4)) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (<= ~top~0 0)), 104036#(and (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (<= 0 (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0))] [2022-03-15 17:38:39,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 17:38:39,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:38:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 17:38:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=6128, Unknown=7, NotChecked=486, Total=7140 [2022-03-15 17:38:39,050 INFO L87 Difference]: Start difference. First operand 1356 states and 2674 transitions. Second operand has 35 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 states have internal predecessors, (81), 0 states have call successors, (0), 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 17:38:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:38:42,523 INFO L93 Difference]: Finished difference Result 1696 states and 3309 transitions. [2022-03-15 17:38:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 17:38:42,524 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 states have internal predecessors, (81), 0 states have call successors, (0), 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 51 [2022-03-15 17:38:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:38:42,525 INFO L225 Difference]: With dead ends: 1696 [2022-03-15 17:38:42,526 INFO L226 Difference]: Without dead ends: 1587 [2022-03-15 17:38:42,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3791 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=1010, Invalid=10767, Unknown=7, NotChecked=648, Total=12432 [2022-03-15 17:38:42,526 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 2784 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:38:42,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2784 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 17:38:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2022-03-15 17:38:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1435. [2022-03-15 17:38:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1433 states have (on average 1.969993021632938) internal successors, (2823), 1434 states have internal predecessors, (2823), 0 states have call successors, (0), 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 17:38:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2823 transitions. [2022-03-15 17:38:42,542 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2823 transitions. Word has length 51 [2022-03-15 17:38:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:38:42,542 INFO L470 AbstractCegarLoop]: Abstraction has 1435 states and 2823 transitions. [2022-03-15 17:38:42,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 states have internal predecessors, (81), 0 states have call successors, (0), 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 17:38:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2823 transitions. [2022-03-15 17:38:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 17:38:42,544 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:38:42,544 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:38:42,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 17:38:42,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:38:42,761 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:38:42,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:38:42,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1497442883, now seen corresponding path program 14 times [2022-03-15 17:38:42,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:38:42,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730406813] [2022-03-15 17:38:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:38:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:38:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:38:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 17:38:43,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:38:43,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730406813] [2022-03-15 17:38:43,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730406813] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:38:43,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96365151] [2022-03-15 17:38:43,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:38:43,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:38:43,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:38:43,712 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 17:38:43,713 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 17:38:43,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:38:43,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:38:43,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 117 conjunts are in the unsatisfiable core [2022-03-15 17:38:43,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:38:43,952 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:38:43,953 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 17:38:44,181 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 17:38:44,340 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 21 treesize of output 21 [2022-03-15 17:38:44,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:38:44,620 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 30 treesize of output 25 [2022-03-15 17:38:45,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:38:45,073 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 30 treesize of output 25 [2022-03-15 17:38:45,471 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 57 treesize of output 33 [2022-03-15 17:38:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-15 17:38:45,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:38:46,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2180) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:38:46,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2180) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296)))) is different from false [2022-03-15 17:38:46,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2180) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:38:46,420 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:38:46,420 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 29 treesize of output 30 [2022-03-15 17:38:46,430 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:38:46,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 49 treesize of output 52 [2022-03-15 17:38:46,434 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 22 [2022-03-15 17:38:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 4 not checked. [2022-03-15 17:38:46,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96365151] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:38:46,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:38:46,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 59 [2022-03-15 17:38:46,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1168459125] [2022-03-15 17:38:46,665 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:38:46,671 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:38:46,695 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 103 transitions. [2022-03-15 17:38:46,695 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:38:47,479 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [109020#(and (<= 0 (* ~top~0 4)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (<= ~top~0 0)), 109019#(and (<= 0 (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) 0) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0))] [2022-03-15 17:38:47,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 17:38:47,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:38:47,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 17:38:47,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3320, Unknown=3, NotChecked=354, Total=3906 [2022-03-15 17:38:47,481 INFO L87 Difference]: Start difference. First operand 1435 states and 2823 transitions. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 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 17:38:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:38:50,027 INFO L93 Difference]: Finished difference Result 1755 states and 3441 transitions. [2022-03-15 17:38:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 17:38:50,027 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 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 51 [2022-03-15 17:38:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:38:50,029 INFO L225 Difference]: With dead ends: 1755 [2022-03-15 17:38:50,029 INFO L226 Difference]: Without dead ends: 1633 [2022-03-15 17:38:50,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 79 SyntacticMatches, 15 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=497, Invalid=6318, Unknown=3, NotChecked=492, Total=7310 [2022-03-15 17:38:50,030 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 178 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 2323 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:38:50,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 0 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 17:38:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-03-15 17:38:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1511. [2022-03-15 17:38:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1509 states have (on average 1.9516235917826374) internal successors, (2945), 1510 states have internal predecessors, (2945), 0 states have call successors, (0), 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 17:38:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2945 transitions. [2022-03-15 17:38:50,048 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2945 transitions. Word has length 51 [2022-03-15 17:38:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:38:50,048 INFO L470 AbstractCegarLoop]: Abstraction has 1511 states and 2945 transitions. [2022-03-15 17:38:50,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 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 17:38:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2945 transitions. [2022-03-15 17:38:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 17:38:50,049 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:38:50,049 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:38:50,068 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 17:38:50,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:38:50,264 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:38:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:38:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash -980076763, now seen corresponding path program 15 times [2022-03-15 17:38:50,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:38:50,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465373372] [2022-03-15 17:38:50,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:38:50,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:38:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:38:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:38:51,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:38:51,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465373372] [2022-03-15 17:38:51,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465373372] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:38:51,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054638042] [2022-03-15 17:38:51,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:38:51,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:38:51,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:38:51,709 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 17:38:51,709 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 17:38:51,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 17:38:51,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:38:51,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 102 conjunts are in the unsatisfiable core [2022-03-15 17:38:51,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:38:51,961 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:38:51,962 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 17:38:52,371 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 19 treesize of output 15 [2022-03-15 17:38:52,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:38:52,982 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 51 treesize of output 38 [2022-03-15 17:38:53,168 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 42 treesize of output 38 [2022-03-15 17:38:53,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:38:53,616 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 51 treesize of output 38 [2022-03-15 17:38:55,069 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 78 treesize of output 46 [2022-03-15 17:39:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:39:46,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:40:36,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2268) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))))) (= (+ 4294967294 (* 4294967296 (div .cse0 4294967296))) .cse0)))) is different from false [2022-03-15 17:40:36,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2268) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset| (- 4))))) (= (+ 4294967294 (* (div .cse0 4294967296) 4294967296)) .cse0)))) is different from false [2022-03-15 17:40:36,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (not (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2268) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296)))))) is different from false [2022-03-15 17:40:36,696 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int))) (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_2266)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2268) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ (* (div .cse0 4294967296) 4294967296) 4294967294))))) is different from false [2022-03-15 17:40:36,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_519| Int)) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_519|)) v_ArrVal_2266)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2268) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ (* (div .cse0 4294967296) 4294967296) 4294967294)))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_519| c_~top~0))) is different from false [2022-03-15 17:40:36,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_519| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_193| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_519| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_193|)) (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_193| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_519|)) v_ArrVal_2266)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2268) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= (+ 4294967294 (* (div .cse0 4294967296) 4294967296)) .cse0))))) is different from false [2022-03-15 17:40:36,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_519| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_193| Int)) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_193| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_519|)) v_ArrVal_2266)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2268) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (= .cse0 (+ 4294967294 (* (div .cse0 4294967296) 4294967296))))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_193| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_519| c_~top~0))) is different from false [2022-03-15 17:40:36,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_519| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_193| Int)) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_193| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_519|)) v_ArrVal_2266)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2268) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_519| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_193| |c_~#arr~0.offset|))) is different from false [2022-03-15 17:40:36,903 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_519| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_193| Int)) (or (not (let ((.cse0 (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_193| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_519|)) v_ArrVal_2266)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2268) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))))) (= (+ (* (div .cse0 4294967296) 4294967296) 4294967294) .cse0))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_193| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_519| (+ c_~top~0 1)))) is different from false [2022-03-15 17:40:36,937 INFO L353 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-03-15 17:40:36,937 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 2 case distinctions, treesize of input 104 treesize of output 75 [2022-03-15 17:40:36,949 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:40:36,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 89 treesize of output 84 [2022-03-15 17:40:36,954 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 42 treesize of output 30 [2022-03-15 17:40:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-03-15 17:40:37,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054638042] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:40:37,449 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:40:37,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 28] total 85 [2022-03-15 17:40:37,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1934743782] [2022-03-15 17:40:37,449 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:40:37,454 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:40:37,477 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 103 transitions. [2022-03-15 17:40:37,477 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:40:38,452 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [114232#(and (<= (select (select |#memory_int| |~#arr~0.base|) |~#m~0.offset|) 4) (<= (+ |~#m~0.offset| 4) (+ |~#arr~0.offset| (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (<= |~#arr~0.offset| |~#m~0.offset|) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) |~#m~0.offset|))), 114233#(and (<= (+ |~#m~0.offset| 4) (+ |~#arr~0.offset| (* ~top~0 4))) (<= (select (select |#memory_int| |~#arr~0.base|) |~#m~0.offset|) 4) (<= |~#arr~0.offset| |~#m~0.offset|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) |~#m~0.offset|)) (<= ~top~0 1))] [2022-03-15 17:40:38,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 17:40:38,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:40:38,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 17:40:38,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=5942, Unknown=48, NotChecked=1476, Total=7832 [2022-03-15 17:40:38,453 INFO L87 Difference]: Start difference. First operand 1511 states and 2945 transitions. Second operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 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 17:40:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:40:41,943 INFO L93 Difference]: Finished difference Result 1822 states and 3527 transitions. [2022-03-15 17:40:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 17:40:41,943 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 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 51 [2022-03-15 17:40:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:40:41,945 INFO L225 Difference]: With dead ends: 1822 [2022-03-15 17:40:41,946 INFO L226 Difference]: Without dead ends: 1713 [2022-03-15 17:40:41,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2880 ImplicationChecksByTransitivity, 106.7s TimeCoverageRelationStatistics Valid=714, Invalid=9986, Unknown=48, NotChecked=1908, Total=12656 [2022-03-15 17:40:41,947 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:40:41,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2745 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 17:40:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2022-03-15 17:40:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1571. [2022-03-15 17:40:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1569 states have (on average 1.9439133205863608) internal successors, (3050), 1570 states have internal predecessors, (3050), 0 states have call successors, (0), 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 17:40:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 3050 transitions. [2022-03-15 17:40:41,965 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 3050 transitions. Word has length 51 [2022-03-15 17:40:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:40:41,965 INFO L470 AbstractCegarLoop]: Abstraction has 1571 states and 3050 transitions. [2022-03-15 17:40:41,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 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 17:40:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 3050 transitions. [2022-03-15 17:40:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 17:40:41,967 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:40:41,967 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:40:41,984 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 17:40:42,182 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,SelfDestructingSolverStorable35 [2022-03-15 17:40:42,182 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:40:42,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:40:42,182 INFO L85 PathProgramCache]: Analyzing trace with hash 60885789, now seen corresponding path program 16 times [2022-03-15 17:40:42,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:40:42,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273264372] [2022-03-15 17:40:42,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:40:42,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:40:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:40:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:40:43,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:40:43,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273264372] [2022-03-15 17:40:43,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273264372] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:40:43,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352327728] [2022-03-15 17:40:43,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:40:43,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:40:43,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:40:43,612 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:40:43,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 17:40:43,795 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:40:43,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:40:43,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 107 conjunts are in the unsatisfiable core [2022-03-15 17:40:43,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:40:43,822 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:40:43,822 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 17:40:44,179 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 19 treesize of output 15 [2022-03-15 17:40:44,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:40:44,797 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 51 treesize of output 38 [2022-03-15 17:40:44,993 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 42 treesize of output 38 [2022-03-15 17:40:45,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:40:45,797 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 51 treesize of output 38 [2022-03-15 17:40:46,622 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 78 treesize of output 46 [2022-03-15 17:40:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:40:46,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:41:00,160 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2354 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (= (+ (- 1) c_~top~0) 0)) is different from false [2022-03-15 17:41:00,169 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2354 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset| (- 4))) 4294967296)))) (= |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 0)) is different from false [2022-03-15 17:41:00,178 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_2354 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2022-03-15 17:41:00,189 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_2353 Int) (v_ArrVal_2354 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_2353)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) is different from false [2022-03-15 17:41:00,207 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_2353 Int) (v_ArrVal_2354 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_538| Int)) (or (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_538|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_2353)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_538| c_~top~0)))) is different from false [2022-03-15 17:41:00,248 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_2353 Int) (v_ArrVal_2354 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_199| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_538| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_199|)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_538| c_~top~0) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_538|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_199|) v_ArrVal_2353)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) is different from false [2022-03-15 17:41:00,288 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_2353 Int) (v_ArrVal_2354 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_199| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_538| Int)) (or (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_538|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_199|) v_ArrVal_2353)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_199| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_538| c_~top~0)))) is different from false [2022-03-15 17:41:00,365 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2353 Int) (v_ArrVal_2354 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_199| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_538| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_538| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_199| |c_~#arr~0.offset|) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_538|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_199|) v_ArrVal_2353)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296))))) (= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0)) is different from false [2022-03-15 17:41:00,405 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_2353 Int) (v_ArrVal_2354 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_199| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_538| Int)) (or (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_538|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_199|) v_ArrVal_2353)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_538| (+ c_~top~0 1)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_199| |c_~#arr~0.offset|)))) is different from false [2022-03-15 17:41:00,443 INFO L353 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-03-15 17:41:00,443 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 2 case distinctions, treesize of input 53 treesize of output 60 [2022-03-15 17:41:00,455 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:41:00,455 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 67 treesize of output 70 [2022-03-15 17:41:00,485 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 22 [2022-03-15 17:41:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 16 not checked. [2022-03-15 17:41:00,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352327728] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:41:00,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:41:00,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 26, 26] total 86 [2022-03-15 17:41:00,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933293423] [2022-03-15 17:41:00,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:41:00,977 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:41:00,996 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 69 transitions. [2022-03-15 17:41:00,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:41:01,283 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [119634#(and (<= (select (select |#memory_int| |~#arr~0.base|) 0) 2147483647) (= |~#arr~0.offset| 0) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) (<= 0 (select (select |#memory_int| |~#arr~0.base|) 0)) (<= 4 (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)))] [2022-03-15 17:41:01,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 17:41:01,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:41:01,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 17:41:01,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=5880, Unknown=13, NotChecked=1476, Total=7832 [2022-03-15 17:41:01,284 INFO L87 Difference]: Start difference. First operand 1571 states and 3050 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 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 17:41:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:41:06,435 INFO L93 Difference]: Finished difference Result 2067 states and 3968 transitions. [2022-03-15 17:41:06,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 17:41:06,436 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 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 51 [2022-03-15 17:41:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:41:06,438 INFO L225 Difference]: With dead ends: 2067 [2022-03-15 17:41:06,438 INFO L226 Difference]: Without dead ends: 1903 [2022-03-15 17:41:06,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 123 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3656 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=1150, Invalid=12213, Unknown=13, NotChecked=2124, Total=15500 [2022-03-15 17:41:06,439 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:41:06,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 3260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3169 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 17:41:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2022-03-15 17:41:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1527. [2022-03-15 17:41:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1525 states have (on average 1.9344262295081966) internal successors, (2950), 1526 states have internal predecessors, (2950), 0 states have call successors, (0), 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 17:41:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2950 transitions. [2022-03-15 17:41:06,466 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2950 transitions. Word has length 51 [2022-03-15 17:41:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:41:06,467 INFO L470 AbstractCegarLoop]: Abstraction has 1527 states and 2950 transitions. [2022-03-15 17:41:06,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 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 17:41:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2950 transitions. [2022-03-15 17:41:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 17:41:06,468 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:41:06,468 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:41:06,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 17:41:06,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 17:41:06,686 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:41:06,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:41:06,686 INFO L85 PathProgramCache]: Analyzing trace with hash 736966539, now seen corresponding path program 17 times [2022-03-15 17:41:06,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:41:06,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557157476] [2022-03-15 17:41:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:41:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:41:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-03-15 17:41:07,689 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 17:41:07,690 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 17:41:07,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 17:41:07,690 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. [2022-03-15 17:41:07,691 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-03-15 17:41:07,691 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 17:41:07,691 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-15 17:41:07,691 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-15 17:41:07,692 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 17:41:07,693 INFO L732 BasicCegarLoop]: Path program histogram: [17, 7, 5, 4, 1, 1, 1, 1, 1] [2022-03-15 17:41:07,695 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:41:07,695 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:41:07,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:41:07 BasicIcfg [2022-03-15 17:41:07,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:41:07,696 INFO L158 Benchmark]: Toolchain (without parser) took 866984.62ms. Allocated memory was 194.0MB in the beginning and 346.0MB in the end (delta: 152.0MB). Free memory was 136.1MB in the beginning and 245.6MB in the end (delta: -109.5MB). Peak memory consumption was 44.1MB. Max. memory is 8.0GB. [2022-03-15 17:41:07,696 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:41:07,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.15ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 136.0MB in the beginning and 240.6MB in the end (delta: -104.6MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-03-15 17:41:07,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.97ms. Allocated memory is still 288.4MB. Free memory was 240.6MB in the beginning and 237.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:41:07,696 INFO L158 Benchmark]: Boogie Preprocessor took 20.77ms. Allocated memory is still 288.4MB. Free memory was 237.4MB in the beginning and 235.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 17:41:07,697 INFO L158 Benchmark]: RCFGBuilder took 376.24ms. Allocated memory is still 288.4MB. Free memory was 235.8MB in the beginning and 219.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-15 17:41:07,697 INFO L158 Benchmark]: TraceAbstraction took 866102.31ms. Allocated memory was 288.4MB in the beginning and 346.0MB in the end (delta: 57.7MB). Free memory was 219.1MB in the beginning and 245.6MB in the end (delta: -26.5MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2022-03-15 17:41:07,697 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.13ms. Allocated memory is still 194.0MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.15ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 136.0MB in the beginning and 240.6MB in the end (delta: -104.6MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.97ms. Allocated memory is still 288.4MB. Free memory was 240.6MB in the beginning and 237.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.77ms. Allocated memory is still 288.4MB. Free memory was 237.4MB in the beginning and 235.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 376.24ms. Allocated memory is still 288.4MB. Free memory was 235.8MB in the beginning and 219.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 866102.31ms. Allocated memory was 288.4MB in the beginning and 346.0MB in the end (delta: 57.7MB). Free memory was 219.1MB in the beginning and 245.6MB in the end (delta: -26.5MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 173 PlacesBefore, 38 PlacesAfterwards, 176 TransitionsBefore, 36 TransitionsAfterwards, 8324 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 5 ChoiceCompositions, 166 TotalNumberOfCompositions, 11261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8861, positive: 8674, positive conditional: 0, positive unconditional: 8674, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4886, positive: 4825, positive conditional: 0, positive unconditional: 4825, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8861, positive: 3849, positive conditional: 0, positive unconditional: 3849, negative: 126, negative conditional: 0, negative unconditional: 126, unknown: 4886, unknown conditional: 0, unknown unconditional: 4886] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 276 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 865.9s, OverallIterations: 38, TraceHistogramMax: 6, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.1s, AutomataDifference: 69.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5483 SdHoareTripleChecker+Valid, 35.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5483 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 31.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 710 IncrementalHoareTripleChecker+Unchecked, 25489 mSDsCounter, 1147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65636 IncrementalHoareTripleChecker+Invalid, 67493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1147 mSolverCounterUnsat, 12 mSDtfsCounter, 65636 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4310 GetRequests, 2183 SyntacticMatches, 100 SemanticMatches, 2027 ConstructedPredicates, 64 IntricatePredicates, 0 DeprecatedPredicates, 43044 ImplicationChecksByTransitivity, 766.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1571occurred in iteration=36, InterpolantAutomatonStates: 793, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 37 MinimizatonAttempts, 10193 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 762.7s InterpolantComputationTime, 2603 NumberOfCodeBlocks, 2547 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 3649 ConstructedInterpolants, 174 QuantifiedInterpolants, 77218 SizeOfPredicates, 818 NumberOfNonLiveVariables, 10835 ConjunctsInSsa, 1930 ConjunctsInUnsatCore, 96 InterpolantComputations, 11 PerfectInterpolantSequences, 957/3133 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown