/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-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:53:13,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:53:13,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:53:13,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:53:13,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:53:13,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:53:13,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:53:13,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:53:13,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:53:13,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:53:13,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:53:13,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:53:13,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:53:13,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:53:13,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:53:13,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:53:13,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:53:13,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:53:13,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:53:13,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:53:13,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:53:13,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:53:13,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:53:13,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:53:13,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:53:13,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:53:13,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:53:13,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:53:13,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:53:13,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:53:13,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:53:13,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:53:13,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:53:13,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:53:13,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:53:13,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:53:13,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:53:13,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:53:13,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:53:13,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:53:13,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:53:13,295 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:53:13,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:53:13,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:53:13,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:53:13,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:53:13,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:53:13,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:53:13,319 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:53:13,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:53:13,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:53:13,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:53:13,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:53:13,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:53:13,322 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:53:13,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:53:13,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:53:13,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:53:13,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:53:13,538 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:53:13,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-03-15 17:53:13,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63595ad29/5e66c2855ec941b28f05950a33c5f6de/FLAG4a048ae4a [2022-03-15 17:53:13,997 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:53:13,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-03-15 17:53:14,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63595ad29/5e66c2855ec941b28f05950a33c5f6de/FLAG4a048ae4a [2022-03-15 17:53:14,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63595ad29/5e66c2855ec941b28f05950a33c5f6de [2022-03-15 17:53:14,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:53:14,035 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:53:14,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:53:14,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:53:14,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:53:14,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5b523b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14, skipping insertion in model container [2022-03-15 17:53:14,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:53:14,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:53:14,240 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-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-03-15 17:53:14,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:53:14,416 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:53:14,430 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-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-03-15 17:53:14,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:53:14,517 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:53:14,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14 WrapperNode [2022-03-15 17:53:14,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:53:14,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:53:14,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:53:14,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:53:14,524 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:53:14" (1/1) ... [2022-03-15 17:53:14,539 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:53:14" (1/1) ... [2022-03-15 17:53:14,562 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 191 [2022-03-15 17:53:14,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:53:14,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:53:14,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:53:14,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:53:14,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:53:14,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:53:14,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:53:14,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:53:14,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14" (1/1) ... [2022-03-15 17:53:14,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:53:14,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:53:14,633 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:53:14,655 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:53:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:53:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:53:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:53:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:53:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:53:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:53:14,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:53:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:53:14,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:53:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:53:14,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:53:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-03-15 17:53:14,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-03-15 17:53:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:53:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:53:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:53:14,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:53:14,678 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:53:14,787 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:53:14,789 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:53:15,249 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:53:15,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:53:15,483 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:53:15,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:53:15 BoogieIcfgContainer [2022-03-15 17:53:15,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:53:15,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:53:15,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:53:15,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:53:15,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:53:14" (1/3) ... [2022-03-15 17:53:15,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428d3ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:53:15, skipping insertion in model container [2022-03-15 17:53:15,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:53:14" (2/3) ... [2022-03-15 17:53:15,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428d3ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:53:15, skipping insertion in model container [2022-03-15 17:53:15,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:53:15" (3/3) ... [2022-03-15 17:53:15,490 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-03-15 17:53:15,493 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:53:15,493 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:53:15,494 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:53:15,494 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:53:15,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,529 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,529 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,529 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,529 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,530 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,530 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,530 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,530 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,530 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,531 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,531 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,531 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,531 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,531 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,532 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,532 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,532 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,532 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,533 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,533 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,534 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,534 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,534 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,534 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,534 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,535 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,535 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,535 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,535 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,535 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,535 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,535 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,536 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,536 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,536 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,539 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,539 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,539 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,539 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,539 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,539 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,539 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,539 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,540 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,540 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,540 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,540 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,540 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,540 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,540 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,540 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,542 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,542 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,542 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,542 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,542 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,542 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,542 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,543 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,543 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,544 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,544 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,544 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,545 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,546 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,549 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,550 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,550 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,550 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,550 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,550 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,550 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,550 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,550 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,550 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,551 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,552 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,553 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,553 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,553 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,553 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,553 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,553 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,553 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,553 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,555 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,555 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,555 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,555 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,555 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,555 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,555 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,555 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,555 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,556 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,557 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,558 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,563 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,563 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,563 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,563 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,563 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,563 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,563 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,563 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,564 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,564 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,564 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,564 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,566 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,566 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,567 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,567 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,567 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,567 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,567 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,567 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,567 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,568 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,568 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,568 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,569 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,570 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,570 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,570 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,570 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,571 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,573 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,574 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,574 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,574 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,574 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,574 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,574 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,574 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,575 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,575 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,575 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,575 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,579 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,582 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,582 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,582 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,582 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,582 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,582 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,582 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,582 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,583 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,583 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:53:15,583 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:53:15,618 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:53:15,624 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:53:15,624 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 17:53:15,636 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:53:15,641 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 290 flow [2022-03-15 17:53:15,643 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 290 flow [2022-03-15 17:53:15,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-03-15 17:53:15,692 INFO L129 PetriNetUnfolder]: 2/131 cut-off events. [2022-03-15 17:53:15,693 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:53:15,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-03-15 17:53:15,700 INFO L116 LiptonReduction]: Number of co-enabled transitions 3290 [2022-03-15 17:53:19,716 INFO L131 LiptonReduction]: Checked pairs total: 8152 [2022-03-15 17:53:19,716 INFO L133 LiptonReduction]: Total number of compositions: 114 [2022-03-15 17:53:19,723 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2022-03-15 17:53:19,863 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3624 states, 3621 states have (on average 3.973211819939243) internal successors, (14387), 3623 states have internal predecessors, (14387), 0 states have call successors, (0), 0 states have 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:53:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 3624 states, 3621 states have (on average 3.973211819939243) internal successors, (14387), 3623 states have internal predecessors, (14387), 0 states have call successors, (0), 0 states have 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:53:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-03-15 17:53:19,881 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:19,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-03-15 17:53:19,882 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:19,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1270297, now seen corresponding path program 1 times [2022-03-15 17:53:19,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:19,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433853513] [2022-03-15 17:53:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:20,073 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:53:20,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:20,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433853513] [2022-03-15 17:53:20,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433853513] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:20,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:20,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:53:20,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1607096865] [2022-03-15 17:53:20,076 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:20,077 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:20,083 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2022-03-15 17:53:20,083 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:20,085 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:20,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:53:20,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:20,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:53:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:53:20,112 INFO L87 Difference]: Start difference. First operand has 3624 states, 3621 states have (on average 3.973211819939243) internal successors, (14387), 3623 states have internal predecessors, (14387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have 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:53:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:20,245 INFO L93 Difference]: Finished difference Result 2937 states and 11300 transitions. [2022-03-15 17:53:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:53:20,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-03-15 17:53:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:20,282 INFO L225 Difference]: With dead ends: 2937 [2022-03-15 17:53:20,283 INFO L226 Difference]: Without dead ends: 2812 [2022-03-15 17:53:20,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:53:20,286 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:20,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 6 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2022-03-15 17:53:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2022-03-15 17:53:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 3.8687299893276412) internal successors, (10875), 2811 states have internal predecessors, (10875), 0 states have call successors, (0), 0 states have 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:53:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 10875 transitions. [2022-03-15 17:53:20,472 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 10875 transitions. Word has length 3 [2022-03-15 17:53:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:20,473 INFO L470 AbstractCegarLoop]: Abstraction has 2812 states and 10875 transitions. [2022-03-15 17:53:20,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have 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:53:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 10875 transitions. [2022-03-15 17:53:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 17:53:20,474 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:20,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:20,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:53:20,475 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash -53678860, now seen corresponding path program 1 times [2022-03-15 17:53:20,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:20,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222857556] [2022-03-15 17:53:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:20,595 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:53:20,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:20,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222857556] [2022-03-15 17:53:20,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222857556] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:20,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:20,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:53:20,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379137669] [2022-03-15 17:53:20,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:20,597 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:20,599 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 17:53:20,599 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:20,600 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:20,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:53:20,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:53:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:53:20,601 INFO L87 Difference]: Start difference. First operand 2812 states and 10875 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have 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:53:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:20,698 INFO L93 Difference]: Finished difference Result 4938 states and 18419 transitions. [2022-03-15 17:53:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:53:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-03-15 17:53:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:20,723 INFO L225 Difference]: With dead ends: 4938 [2022-03-15 17:53:20,723 INFO L226 Difference]: Without dead ends: 4452 [2022-03-15 17:53:20,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:53:20,724 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:20,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2022-03-15 17:53:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 3963. [2022-03-15 17:53:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3962 states have (on average 3.776123170116103) internal successors, (14961), 3962 states have internal predecessors, (14961), 0 states have call successors, (0), 0 states have 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:53:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 14961 transitions. [2022-03-15 17:53:20,895 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 14961 transitions. Word has length 11 [2022-03-15 17:53:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:20,896 INFO L470 AbstractCegarLoop]: Abstraction has 3963 states and 14961 transitions. [2022-03-15 17:53:20,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have 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:53:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 14961 transitions. [2022-03-15 17:53:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 17:53:20,902 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:20,902 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:20,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:53:20,902 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1432587365, now seen corresponding path program 1 times [2022-03-15 17:53:20,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:20,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502474465] [2022-03-15 17:53:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:20,972 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:53:20,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:20,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502474465] [2022-03-15 17:53:20,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502474465] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:20,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:20,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:53:20,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249371325] [2022-03-15 17:53:20,973 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:20,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:20,976 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2022-03-15 17:53:20,976 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:21,050 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:21,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:53:21,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:53:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:53:21,051 INFO L87 Difference]: Start difference. First operand 3963 states and 14961 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have 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:53:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:21,129 INFO L93 Difference]: Finished difference Result 3893 states and 14675 transitions. [2022-03-15 17:53:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:53:21,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-03-15 17:53:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:21,152 INFO L225 Difference]: With dead ends: 3893 [2022-03-15 17:53:21,152 INFO L226 Difference]: Without dead ends: 3893 [2022-03-15 17:53:21,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:53:21,153 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:21,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 5 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:53:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2022-03-15 17:53:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3809. [2022-03-15 17:53:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3809 states, 3808 states have (on average 3.766544117647059) internal successors, (14343), 3808 states have internal predecessors, (14343), 0 states have call successors, (0), 0 states have 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:53:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 14343 transitions. [2022-03-15 17:53:21,271 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 14343 transitions. Word has length 12 [2022-03-15 17:53:21,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:21,271 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 14343 transitions. [2022-03-15 17:53:21,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have 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:53:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 14343 transitions. [2022-03-15 17:53:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 17:53:21,273 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:21,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:21,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:53:21,273 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1454466502, now seen corresponding path program 1 times [2022-03-15 17:53:21,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:21,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587653285] [2022-03-15 17:53:21,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:21,331 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:53:21,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:21,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587653285] [2022-03-15 17:53:21,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587653285] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:21,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:21,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:53:21,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [368616858] [2022-03-15 17:53:21,331 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:21,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:21,334 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2022-03-15 17:53:21,334 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:21,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [40346#(or (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))] [2022-03-15 17:53:21,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:53:21,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:53:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:53:21,432 INFO L87 Difference]: Start difference. First operand 3809 states and 14343 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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:53:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:21,574 INFO L93 Difference]: Finished difference Result 5185 states and 18996 transitions. [2022-03-15 17:53:21,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:53:21,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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 12 [2022-03-15 17:53:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:21,608 INFO L225 Difference]: With dead ends: 5185 [2022-03-15 17:53:21,608 INFO L226 Difference]: Without dead ends: 5185 [2022-03-15 17:53:21,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:53:21,613 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:21,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 6 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2022-03-15 17:53:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 3994. [2022-03-15 17:53:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 3993 states have (on average 3.751565239168545) internal successors, (14980), 3993 states have internal predecessors, (14980), 0 states have call successors, (0), 0 states have 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:53:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 14980 transitions. [2022-03-15 17:53:21,723 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 14980 transitions. Word has length 12 [2022-03-15 17:53:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:21,724 INFO L470 AbstractCegarLoop]: Abstraction has 3994 states and 14980 transitions. [2022-03-15 17:53:21,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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:53:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 14980 transitions. [2022-03-15 17:53:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 17:53:21,726 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:21,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:21,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:53:21,726 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1657975807, now seen corresponding path program 1 times [2022-03-15 17:53:21,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:21,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8427454] [2022-03-15 17:53:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:21,789 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:53:21,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:21,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8427454] [2022-03-15 17:53:21,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8427454] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:21,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:21,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:53:21,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019103544] [2022-03-15 17:53:21,790 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:21,792 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:21,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 47 transitions. [2022-03-15 17:53:21,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:21,964 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:21,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:53:21,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:53:21,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:53:21,966 INFO L87 Difference]: Start difference. First operand 3994 states and 14980 transitions. Second operand has 4 states, 4 states have (on average 4.25) 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:53:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:22,085 INFO L93 Difference]: Finished difference Result 4005 states and 13629 transitions. [2022-03-15 17:53:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:53:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) 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 13 [2022-03-15 17:53:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:22,094 INFO L225 Difference]: With dead ends: 4005 [2022-03-15 17:53:22,094 INFO L226 Difference]: Without dead ends: 3014 [2022-03-15 17:53:22,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:53:22,096 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:22,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 15 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:22,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2022-03-15 17:53:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3014. [2022-03-15 17:53:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 3013 states have (on average 3.364088947892466) internal successors, (10136), 3013 states have internal predecessors, (10136), 0 states have call successors, (0), 0 states have 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:53:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 10136 transitions. [2022-03-15 17:53:22,184 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 10136 transitions. Word has length 13 [2022-03-15 17:53:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:22,185 INFO L470 AbstractCegarLoop]: Abstraction has 3014 states and 10136 transitions. [2022-03-15 17:53:22,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) 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:53:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 10136 transitions. [2022-03-15 17:53:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:53:22,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:22,188 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:53:22,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:53:22,188 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1242953665, now seen corresponding path program 1 times [2022-03-15 17:53:22,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:22,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702247954] [2022-03-15 17:53:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:22,266 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:53:22,266 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:22,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702247954] [2022-03-15 17:53:22,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702247954] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:22,266 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:22,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:53:22,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184966230] [2022-03-15 17:53:22,267 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:22,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:22,273 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 85 transitions. [2022-03-15 17:53:22,274 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:22,786 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [63564#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:53:22,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:53:22,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:22,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:53:22,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:53:22,787 INFO L87 Difference]: Start difference. First operand 3014 states and 10136 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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:53:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:22,922 INFO L93 Difference]: Finished difference Result 2561 states and 7969 transitions. [2022-03-15 17:53:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:53:22,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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:53:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:22,928 INFO L225 Difference]: With dead ends: 2561 [2022-03-15 17:53:22,928 INFO L226 Difference]: Without dead ends: 1970 [2022-03-15 17:53:22,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:53:22,929 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:22,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 21 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2022-03-15 17:53:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1934. [2022-03-15 17:53:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1933 states have (on average 3.0522503879979306) internal successors, (5900), 1933 states have internal predecessors, (5900), 0 states have call successors, (0), 0 states have 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:53:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 5900 transitions. [2022-03-15 17:53:22,967 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 5900 transitions. Word has length 16 [2022-03-15 17:53:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:22,967 INFO L470 AbstractCegarLoop]: Abstraction has 1934 states and 5900 transitions. [2022-03-15 17:53:22,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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:53:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 5900 transitions. [2022-03-15 17:53:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 17:53:22,970 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:22,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:22,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:53:22,970 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:22,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -355450761, now seen corresponding path program 1 times [2022-03-15 17:53:22,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:22,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9188569] [2022-03-15 17:53:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:22,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:23,022 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:53:23,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:23,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9188569] [2022-03-15 17:53:23,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9188569] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:23,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:23,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:53:23,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251553686] [2022-03-15 17:53:23,023 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:23,025 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:23,035 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 155 transitions. [2022-03-15 17:53:23,035 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:24,483 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [70001#(or (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 70000#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)))] [2022-03-15 17:53:24,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:53:24,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:24,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:53:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:53:24,483 INFO L87 Difference]: Start difference. First operand 1934 states and 5900 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:53:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:24,597 INFO L93 Difference]: Finished difference Result 3203 states and 9482 transitions. [2022-03-15 17:53:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:53:24,597 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 19 [2022-03-15 17:53:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:24,602 INFO L225 Difference]: With dead ends: 3203 [2022-03-15 17:53:24,602 INFO L226 Difference]: Without dead ends: 1994 [2022-03-15 17:53:24,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:53:24,602 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:24,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 10 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2022-03-15 17:53:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1603. [2022-03-15 17:53:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1602 states have (on average 2.922596754057428) internal successors, (4682), 1602 states have internal predecessors, (4682), 0 states have call successors, (0), 0 states have 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:53:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 4682 transitions. [2022-03-15 17:53:24,632 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 4682 transitions. Word has length 19 [2022-03-15 17:53:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:24,632 INFO L470 AbstractCegarLoop]: Abstraction has 1603 states and 4682 transitions. [2022-03-15 17:53:24,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:53:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 4682 transitions. [2022-03-15 17:53:24,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 17:53:24,635 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:24,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:24,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:53:24,635 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2017229399, now seen corresponding path program 1 times [2022-03-15 17:53:24,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:24,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923577859] [2022-03-15 17:53:24,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:24,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:24,685 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:53:24,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:24,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923577859] [2022-03-15 17:53:24,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923577859] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:24,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:24,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:53:24,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1989752511] [2022-03-15 17:53:24,686 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:24,688 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:24,696 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 133 transitions. [2022-03-15 17:53:24,696 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:25,281 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [76417#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:53:25,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:53:25,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:25,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:53:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:53:25,282 INFO L87 Difference]: Start difference. First operand 1603 states and 4682 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:53:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:25,433 INFO L93 Difference]: Finished difference Result 1420 states and 4113 transitions. [2022-03-15 17:53:25,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:53:25,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 19 [2022-03-15 17:53:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:25,436 INFO L225 Difference]: With dead ends: 1420 [2022-03-15 17:53:25,436 INFO L226 Difference]: Without dead ends: 1254 [2022-03-15 17:53:25,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:53:25,436 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 110 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:25,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 25 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-03-15 17:53:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1140. [2022-03-15 17:53:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 2.9306409130816506) internal successors, (3338), 1139 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have 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:53:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 3338 transitions. [2022-03-15 17:53:25,455 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 3338 transitions. Word has length 19 [2022-03-15 17:53:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:25,455 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 3338 transitions. [2022-03-15 17:53:25,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:53:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 3338 transitions. [2022-03-15 17:53:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:53:25,457 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:25,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:25,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:53:25,457 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash -376603108, now seen corresponding path program 1 times [2022-03-15 17:53:25,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:25,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490634282] [2022-03-15 17:53:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:25,518 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:53:25,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:25,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490634282] [2022-03-15 17:53:25,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490634282] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:25,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:25,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 17:53:25,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142503401] [2022-03-15 17:53:25,518 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:25,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:25,570 INFO L252 McrAutomatonBuilder]: Finished intersection with 225 states and 535 transitions. [2022-03-15 17:53:25,570 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:27,557 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [80127#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:53:27,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:53:27,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:27,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:53:27,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:53:27,558 INFO L87 Difference]: Start difference. First operand 1140 states and 3338 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 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:53:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:27,699 INFO L93 Difference]: Finished difference Result 1107 states and 3272 transitions. [2022-03-15 17:53:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:53:27,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 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 23 [2022-03-15 17:53:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:27,701 INFO L225 Difference]: With dead ends: 1107 [2022-03-15 17:53:27,701 INFO L226 Difference]: Without dead ends: 719 [2022-03-15 17:53:27,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:53:27,701 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 113 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:27,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 19 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-03-15 17:53:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 548. [2022-03-15 17:53:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 2.915904936014625) internal successors, (1595), 547 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have 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:53:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1595 transitions. [2022-03-15 17:53:27,710 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1595 transitions. Word has length 23 [2022-03-15 17:53:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:27,711 INFO L470 AbstractCegarLoop]: Abstraction has 548 states and 1595 transitions. [2022-03-15 17:53:27,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 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:53:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1595 transitions. [2022-03-15 17:53:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 17:53:27,712 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:27,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:27,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:53:27,713 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1958468472, now seen corresponding path program 1 times [2022-03-15 17:53:27,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:27,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206719761] [2022-03-15 17:53:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:27,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:27,890 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:53:27,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:27,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206719761] [2022-03-15 17:53:27,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206719761] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:27,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:27,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 17:53:27,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124133894] [2022-03-15 17:53:27,891 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:27,894 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:27,998 INFO L252 McrAutomatonBuilder]: Finished intersection with 256 states and 597 transitions. [2022-03-15 17:53:27,998 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:42,190 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [82347#(and (or (= (mod ~a$r_buff0_thd2~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd4~0 0)) (or (= (mod ~a$r_buff0_thd3~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0)))), 82346#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd2~0 0) (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff0_thd4~0 0)), 82344#(and (= ~a$r_buff1_thd4~0 0) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (= (mod ~a$r_buff0_thd1~0 256) 0)) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$w_buff0~0 1) (or (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (not (= (mod ~a$r_buff0_thd3~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (= (mod ~a$r_buff1_thd3~0 256) 0)) (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd4~0 0)), 82341#(and (= ~a$r_buff1_thd4~0 0) (or (= ~a~0 1) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= (mod ~a$r_buff0_thd3~0 256) 0) (= (mod ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1)) (or (= ~a~0 1) (not (= (mod ~a$r_buff0_thd3~0 256) 0))) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (not (= (mod ~a$r_buff0_thd3~0 256) 0))) (= ~a$r_buff0_thd4~0 0)), 82348#(and (or (= ~a$r_buff0_thd3~0 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd4~0 0))), 82342#(and (or (= ~a~0 1) (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (not (= (mod ~a$r_buff0_thd3~0 256) 0))) (= ~a$r_buff1_thd4~0 0) (or (= ~a~0 1) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (not (= (mod ~a$r_buff0_thd3~0 256) 0))) (or (= (mod ~a$r_buff0_thd3~0 256) 0) (= (mod ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1)) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (= (mod ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1)) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (not (= (mod ~a$r_buff0_thd3~0 256) 0))) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (= (mod ~a$r_buff1_thd3~0 256) 0)) (= ~a$r_buff0_thd4~0 0)), 82345#(and (= ~a$r_buff1_thd4~0 0) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (not (= (mod ~a$w_buff0_used~0 256) 0)) (or (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (= ~a$r_buff0_thd4~0 0)), 82343#(and (or (= ~a~0 ~a$w_buff0~0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (= ~a$r_buff1_thd4~0 0) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (not (= (mod ~a$r_buff0_thd2~0 256) 0))) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (= ~a~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0))] [2022-03-15 17:53:42,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 17:53:42,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 17:53:42,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-03-15 17:53:42,191 INFO L87 Difference]: Start difference. First operand 548 states and 1595 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have 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:53:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:42,468 INFO L93 Difference]: Finished difference Result 652 states and 1860 transitions. [2022-03-15 17:53:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:53:42,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 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:53:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:42,471 INFO L225 Difference]: With dead ends: 652 [2022-03-15 17:53:42,471 INFO L226 Difference]: Without dead ends: 324 [2022-03-15 17:53:42,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-03-15 17:53:42,472 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 119 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:42,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 36 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:53:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-03-15 17:53:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-03-15 17:53:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.5603715170278636) internal successors, (827), 323 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have 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:53:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 827 transitions. [2022-03-15 17:53:42,477 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 827 transitions. Word has length 27 [2022-03-15 17:53:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:42,477 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 827 transitions. [2022-03-15 17:53:42,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have 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:53:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 827 transitions. [2022-03-15 17:53:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 17:53:42,478 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:42,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:42,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:53:42,478 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash -624278216, now seen corresponding path program 2 times [2022-03-15 17:53:42,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:42,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747986431] [2022-03-15 17:53:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:42,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:53:42,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:53:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:53:42,644 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:53:42,644 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:53:42,645 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-15 17:53:42,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-15 17:53:42,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-03-15 17:53:42,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-03-15 17:53:42,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-03-15 17:53:42,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-03-15 17:53:42,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-15 17:53:42,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 17:53:42,648 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:42,651 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:53:42,651 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:53:42,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:53:42 BasicIcfg [2022-03-15 17:53:42,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:53:42,721 INFO L158 Benchmark]: Toolchain (without parser) took 28686.40ms. Allocated memory was 196.1MB in the beginning and 622.9MB in the end (delta: 426.8MB). Free memory was 143.2MB in the beginning and 152.4MB in the end (delta: -9.2MB). Peak memory consumption was 418.4MB. Max. memory is 8.0GB. [2022-03-15 17:53:42,721 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 196.1MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:53:42,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.87ms. Allocated memory is still 196.1MB. Free memory was 143.1MB in the beginning and 157.7MB in the end (delta: -14.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 17:53:42,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.51ms. Allocated memory is still 196.1MB. Free memory was 157.7MB in the beginning and 155.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:53:42,722 INFO L158 Benchmark]: Boogie Preprocessor took 23.50ms. Allocated memory is still 196.1MB. Free memory was 155.1MB in the beginning and 152.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:53:42,722 INFO L158 Benchmark]: RCFGBuilder took 897.80ms. Allocated memory was 196.1MB in the beginning and 245.4MB in the end (delta: 49.3MB). Free memory was 152.4MB in the beginning and 215.1MB in the end (delta: -62.7MB). Peak memory consumption was 96.7MB. Max. memory is 8.0GB. [2022-03-15 17:53:42,722 INFO L158 Benchmark]: TraceAbstraction took 27234.75ms. Allocated memory was 245.4MB in the beginning and 622.9MB in the end (delta: 377.5MB). Free memory was 214.6MB in the beginning and 152.4MB in the end (delta: 62.2MB). Peak memory consumption was 439.2MB. Max. memory is 8.0GB. [2022-03-15 17:53:42,723 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.12ms. Allocated memory is still 196.1MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 481.87ms. Allocated memory is still 196.1MB. Free memory was 143.1MB in the beginning and 157.7MB in the end (delta: -14.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.51ms. Allocated memory is still 196.1MB. Free memory was 157.7MB in the beginning and 155.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.50ms. Allocated memory is still 196.1MB. Free memory was 155.1MB in the beginning and 152.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 897.80ms. Allocated memory was 196.1MB in the beginning and 245.4MB in the end (delta: 49.3MB). Free memory was 152.4MB in the beginning and 215.1MB in the end (delta: -62.7MB). Peak memory consumption was 96.7MB. Max. memory is 8.0GB. * TraceAbstraction took 27234.75ms. Allocated memory was 245.4MB in the beginning and 622.9MB in the end (delta: 377.5MB). Free memory was 214.6MB in the beginning and 152.4MB in the end (delta: 62.2MB). Peak memory consumption was 439.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 146 PlacesBefore, 46 PlacesAfterwards, 135 TransitionsBefore, 34 TransitionsAfterwards, 3290 CoEnabledTransitionPairs, 6 FixpointIterations, 44 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 8152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3912, positive: 3719, positive conditional: 0, positive unconditional: 3719, negative: 193, negative conditional: 0, negative unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1828, positive: 1783, positive conditional: 0, positive unconditional: 1783, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3912, positive: 1936, positive conditional: 0, positive unconditional: 1936, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 1828, unknown conditional: 0, unknown unconditional: 1828] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1409, ((void *)0), P0, ((void *)0))=-1, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1410, ((void *)0), P1, ((void *)0))=0, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L863] 0 pthread_t t1411; [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1411, ((void *)0), P2, ((void *)0))=1, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1412, ((void *)0), P3, ((void *)0))=2, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 27.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 745 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1212 IncrementalHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 50 mSDtfsCounter, 1212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3994occurred in iteration=4, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 2476 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2022-03-15 17:53:42,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...