/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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:54:53,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:54:53,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:54:53,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:54:53,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:54:53,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:54:53,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:54:53,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:54:53,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:54:53,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:54:53,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:54:53,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:54:53,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:54:53,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:54:53,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:54:53,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:54:53,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:54:53,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:54:53,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:54:53,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:54:53,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:54:53,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:54:53,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:54:53,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:54:53,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:54:53,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:54:53,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:54:53,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:54:53,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:54:53,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:54:53,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:54:53,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:54:53,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:54:53,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:54:53,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:54:53,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:54:53,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:54:53,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:54:53,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:54:53,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:54:53,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:54:53,352 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:54:53,382 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:54:53,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:54:53,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:54:53,384 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:54:53,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:54:53,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:54:53,384 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:54:53,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:54:53,385 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:54:53,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:54:53,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:54:53,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:54:53,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:54:53,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:54:53,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:54:53,386 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:54:53,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:54:53,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:54:53,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:54:53,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:54:53,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:54:53,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:54:53,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:54:53,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:54:53,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:54:53,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:54:53,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:54:53,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:54:53,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:54:53,388 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:54:53,388 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:54:53,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:54:53,388 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:54:53,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:54:53,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:54:53,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:54:53,654 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:54:53,654 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:54:53,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-03-15 17:54:53,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486aa4513/178da209e8b449638e45f32ba9745fae/FLAGea34fbb1c [2022-03-15 17:54:54,247 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:54:54,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-03-15 17:54:54,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486aa4513/178da209e8b449638e45f32ba9745fae/FLAGea34fbb1c [2022-03-15 17:54:54,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486aa4513/178da209e8b449638e45f32ba9745fae [2022-03-15 17:54:54,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:54:54,728 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:54:54,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:54:54,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:54:54,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:54:54,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:54:54" (1/1) ... [2022-03-15 17:54:54,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14516402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:54, skipping insertion in model container [2022-03-15 17:54:54,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:54:54" (1/1) ... [2022-03-15 17:54:54,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:54:54,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:54:54,920 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-03-15 17:54:55,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:54:55,130 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:54:55,143 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-03-15 17:54:55,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:54:55,228 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:54:55,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55 WrapperNode [2022-03-15 17:54:55,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:54:55,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:54:55,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:54:55,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:54:55,236 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:54:55" (1/1) ... [2022-03-15 17:54:55,270 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:54:55" (1/1) ... [2022-03-15 17:54:55,310 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2022-03-15 17:54:55,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:54:55,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:54:55,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:54:55,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:54:55,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55" (1/1) ... [2022-03-15 17:54:55,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55" (1/1) ... [2022-03-15 17:54:55,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55" (1/1) ... [2022-03-15 17:54:55,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55" (1/1) ... [2022-03-15 17:54:55,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55" (1/1) ... [2022-03-15 17:54:55,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55" (1/1) ... [2022-03-15 17:54:55,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55" (1/1) ... [2022-03-15 17:54:55,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:54:55,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:54:55,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:54:55,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:54:55,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55" (1/1) ... [2022-03-15 17:54:55,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:54:55,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:54:55,394 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:54:55,399 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:54:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:54:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:54:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:54:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:54:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:54:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:54:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:54:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:54:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:54:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:54:55,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:54:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:54:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:54:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:54:55,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:54:55,423 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:54:55,573 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:54:55,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:54:56,098 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:54:56,383 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:54:56,383 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:54:56,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:54:56 BoogieIcfgContainer [2022-03-15 17:54:56,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:54:56,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:54:56,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:54:56,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:54:56,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:54:54" (1/3) ... [2022-03-15 17:54:56,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a472719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:54:56, skipping insertion in model container [2022-03-15 17:54:56,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:54:55" (2/3) ... [2022-03-15 17:54:56,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a472719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:54:56, skipping insertion in model container [2022-03-15 17:54:56,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:54:56" (3/3) ... [2022-03-15 17:54:56,392 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-03-15 17:54:56,397 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:54:56,397 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:54:56,398 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:54:56,398 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:54:56,436 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,436 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,437 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,437 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,437 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,437 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,437 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,437 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,437 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:54:56,438 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,438 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:54:56,438 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,438 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:54:56,438 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,439 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:54:56,439 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,439 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,439 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,439 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,440 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,440 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,440 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,440 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,440 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,441 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,441 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,441 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,441 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,441 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,441 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,442 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,442 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,442 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,442 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,442 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,443 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,443 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,443 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,443 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,443 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,443 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,443 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,443 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,444 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,444 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,444 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,444 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,444 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,444 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,445 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,445 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,445 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,445 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,445 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,445 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,445 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,446 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,446 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,446 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,446 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,447 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,447 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,447 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,447 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,447 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,447 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,447 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,447 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,448 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,448 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,448 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,448 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,448 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,448 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,449 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,449 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,449 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,449 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,449 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,449 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,449 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,453 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,454 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,454 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,454 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,454 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,454 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,454 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,455 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,455 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,455 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:54:56,455 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,456 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,456 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,456 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,456 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,456 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,456 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,456 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,456 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,457 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,457 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,457 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,457 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,457 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,457 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,457 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,458 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,458 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,458 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:54:56,458 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:54:56,494 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:54:56,499 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:54:56,500 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 17:54:56,510 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:54:56,518 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 245 flow [2022-03-15 17:54:56,520 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 245 flow [2022-03-15 17:54:56,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-03-15 17:54:56,556 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2022-03-15 17:54:56,556 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:54:56,559 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-03-15 17:54:56,561 INFO L116 LiptonReduction]: Number of co-enabled transitions 2096 [2022-03-15 17:55:09,626 INFO L131 LiptonReduction]: Checked pairs total: 5117 [2022-03-15 17:55:09,627 INFO L133 LiptonReduction]: Total number of compositions: 101 [2022-03-15 17:55:09,641 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2022-03-15 17:55:09,719 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have 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:55:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have 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:55:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-03-15 17:55:09,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:09,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-03-15 17:55:09,728 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1117814, now seen corresponding path program 1 times [2022-03-15 17:55:09,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:09,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676684931] [2022-03-15 17:55:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:55:09,929 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:55:09,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:55:09,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676684931] [2022-03-15 17:55:09,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676684931] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:55:09,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:55:09,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:55:09,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219382709] [2022-03-15 17:55:09,932 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:55:09,934 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:55:09,941 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2022-03-15 17:55:09,942 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:55:09,944 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:55:09,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:55:09,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:55:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:55:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:55:09,974 INFO L87 Difference]: Start difference. First operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 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:55:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:55:10,071 INFO L93 Difference]: Finished difference Result 587 states and 1790 transitions. [2022-03-15 17:55:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:55:10,079 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:55:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:55:10,101 INFO L225 Difference]: With dead ends: 587 [2022-03-15 17:55:10,101 INFO L226 Difference]: Without dead ends: 562 [2022-03-15 17:55:10,102 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:55:10,106 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:55:10,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:55:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-03-15 17:55:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-03-15 17:55:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.0748663101604277) internal successors, (1725), 561 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have 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:55:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2022-03-15 17:55:10,184 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2022-03-15 17:55:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:55:10,185 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2022-03-15 17:55:10,185 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:55:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2022-03-15 17:55:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 17:55:10,186 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:10,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:10,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:55:10,187 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:10,188 INFO L85 PathProgramCache]: Analyzing trace with hash -634422654, now seen corresponding path program 1 times [2022-03-15 17:55:10,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:10,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631834781] [2022-03-15 17:55:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:55:10,348 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:55:10,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:55:10,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631834781] [2022-03-15 17:55:10,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631834781] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:55:10,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:55:10,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:55:10,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937343008] [2022-03-15 17:55:10,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:55:10,353 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:55:10,355 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2022-03-15 17:55:10,356 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:55:10,356 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:55:10,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:55:10,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:55:10,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:55:10,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:55:10,358 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:55:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:55:10,408 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2022-03-15 17:55:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:55:10,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-03-15 17:55:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:55:10,414 INFO L225 Difference]: With dead ends: 537 [2022-03-15 17:55:10,415 INFO L226 Difference]: Without dead ends: 537 [2022-03-15 17:55:10,417 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:55:10,423 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:55:10,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:55:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-03-15 17:55:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-03-15 17:55:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 3.050373134328358) internal successors, (1635), 536 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have 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:55:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2022-03-15 17:55:10,468 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 9 [2022-03-15 17:55:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:55:10,469 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2022-03-15 17:55:10,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:55:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2022-03-15 17:55:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 17:55:10,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:10,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:10,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:55:10,473 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash -3863229, now seen corresponding path program 1 times [2022-03-15 17:55:10,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:10,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144377307] [2022-03-15 17:55:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:55:10,610 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:55:10,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:55:10,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144377307] [2022-03-15 17:55:10,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144377307] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:55:10,611 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:55:10,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:55:10,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [135181308] [2022-03-15 17:55:10,612 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:55:10,613 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:55:10,615 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2022-03-15 17:55:10,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:55:10,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:55:10,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:55:10,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:55:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:55:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:55:10,734 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:55:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:55:10,791 INFO L93 Difference]: Finished difference Result 517 states and 1564 transitions. [2022-03-15 17:55:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:55:10,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 17:55:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:55:10,795 INFO L225 Difference]: With dead ends: 517 [2022-03-15 17:55:10,795 INFO L226 Difference]: Without dead ends: 517 [2022-03-15 17:55:10,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:55:10,799 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:55:10,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:55:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-03-15 17:55:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2022-03-15 17:55:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 3.0310077519379846) internal successors, (1564), 516 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have 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:55:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1564 transitions. [2022-03-15 17:55:10,816 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1564 transitions. Word has length 10 [2022-03-15 17:55:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:55:10,816 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 1564 transitions. [2022-03-15 17:55:10,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:55:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1564 transitions. [2022-03-15 17:55:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 17:55:10,821 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:10,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:10,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:55:10,822 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash -119822562, now seen corresponding path program 1 times [2022-03-15 17:55:10,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:10,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756997974] [2022-03-15 17:55:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:55:10,935 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:55:10,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:55:10,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756997974] [2022-03-15 17:55:10,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756997974] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:55:10,935 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:55:10,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:55:10,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240793851] [2022-03-15 17:55:10,936 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:55:10,938 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:55:10,941 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 31 transitions. [2022-03-15 17:55:10,941 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:55:11,093 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:55:11,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:55:11,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:55:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:55:11,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:55:11,094 INFO L87 Difference]: Start difference. First operand 517 states and 1564 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:55:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:55:11,169 INFO L93 Difference]: Finished difference Result 689 states and 2029 transitions. [2022-03-15 17:55:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:55:11,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:55:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:55:11,172 INFO L225 Difference]: With dead ends: 689 [2022-03-15 17:55:11,172 INFO L226 Difference]: Without dead ends: 349 [2022-03-15 17:55:11,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:55:11,178 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:55:11,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:55:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-03-15 17:55:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2022-03-15 17:55:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 2.839080459770115) internal successors, (988), 348 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:55:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 988 transitions. [2022-03-15 17:55:11,191 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 988 transitions. Word has length 11 [2022-03-15 17:55:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:55:11,191 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 988 transitions. [2022-03-15 17:55:11,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:55:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 988 transitions. [2022-03-15 17:55:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 17:55:11,192 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:11,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:11,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:55:11,192 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash -829981069, now seen corresponding path program 1 times [2022-03-15 17:55:11,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:11,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623096431] [2022-03-15 17:55:11,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:11,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:55:11,277 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:55:11,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:55:11,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623096431] [2022-03-15 17:55:11,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623096431] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:55:11,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:55:11,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:55:11,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42678136] [2022-03-15 17:55:11,279 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:55:11,281 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:55:11,289 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 68 transitions. [2022-03-15 17:55:11,289 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:55:11,652 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:55:11,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:55:11,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:55:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:55:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:55:11,653 INFO L87 Difference]: Start difference. First operand 349 states and 988 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:55:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:55:11,714 INFO L93 Difference]: Finished difference Result 445 states and 1244 transitions. [2022-03-15 17:55:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:55:11,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:55:11,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:55:11,716 INFO L225 Difference]: With dead ends: 445 [2022-03-15 17:55:11,716 INFO L226 Difference]: Without dead ends: 241 [2022-03-15 17:55:11,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:55:11,717 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:55:11,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 5 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:55:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-03-15 17:55:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-03-15 17:55:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.6791666666666667) internal successors, (643), 240 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have 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:55:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 643 transitions. [2022-03-15 17:55:11,725 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 643 transitions. Word has length 13 [2022-03-15 17:55:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:55:11,725 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 643 transitions. [2022-03-15 17:55:11,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:55:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 643 transitions. [2022-03-15 17:55:11,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 17:55:11,726 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:11,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:11,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:55:11,726 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:11,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1830438488, now seen corresponding path program 1 times [2022-03-15 17:55:11,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:11,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528925986] [2022-03-15 17:55:11,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:55:11,851 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:55:11,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:55:11,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528925986] [2022-03-15 17:55:11,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528925986] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:55:11,852 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:55:11,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:55:11,852 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [845140626] [2022-03-15 17:55:11,852 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:55:11,855 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:55:11,862 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2022-03-15 17:55:11,862 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:55:12,602 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8787#(and (or (not (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff0_thd0~0 0)) (or (not (= ~z$w_buff0~0 2)) (not (= 0 (mod ~z$w_buff0_used~0 256)))) (or (not (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$w_buff0_used~0 0)) (or (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 2 ~z~0))))] [2022-03-15 17:55:12,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:55:12,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:55:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:55:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:55:12,606 INFO L87 Difference]: Start difference. First operand 241 states and 643 transitions. Second operand has 6 states, 5 states have (on average 5.4) 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:55:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:55:12,728 INFO L93 Difference]: Finished difference Result 239 states and 635 transitions. [2022-03-15 17:55:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:55:12,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) 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 14 [2022-03-15 17:55:12,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:55:12,733 INFO L225 Difference]: With dead ends: 239 [2022-03-15 17:55:12,733 INFO L226 Difference]: Without dead ends: 239 [2022-03-15 17:55:12,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:55:12,734 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:55:12,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:55:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-03-15 17:55:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2022-03-15 17:55:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 2.668067226890756) internal successors, (635), 238 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have 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:55:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 635 transitions. [2022-03-15 17:55:12,741 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 635 transitions. Word has length 14 [2022-03-15 17:55:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:55:12,741 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 635 transitions. [2022-03-15 17:55:12,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) 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:55:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 635 transitions. [2022-03-15 17:55:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 17:55:12,742 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:12,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:12,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:55:12,743 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash 908983562, now seen corresponding path program 1 times [2022-03-15 17:55:12,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:12,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360990720] [2022-03-15 17:55:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:55:12,933 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:55:12,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:55:12,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360990720] [2022-03-15 17:55:12,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360990720] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:55:12,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:55:12,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:55:12,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205915184] [2022-03-15 17:55:12,934 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:55:12,936 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:55:12,944 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 59 transitions. [2022-03-15 17:55:12,944 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:55:14,761 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [9514#(and (or (<= 0 ~z$r_buff0_thd2~0) (not (= 0 (mod ~z$w_buff0_used~0 256)))) (or (not (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff0_thd0~0 0)) (or (not (= ~z$w_buff0~0 2)) (not (= 0 (mod ~z$w_buff0_used~0 256)))) (or (not (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$w_buff0_used~0 0)) (or (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 2 ~z~0))) (or (<= ~z$r_buff0_thd2~0 (* (div ~z$r_buff0_thd2~0 256) 256)) (not (= 0 (mod ~z$w_buff0_used~0 256))))), 9515#(and (or (not (= (mod ~z$r_buff0_thd2~0 256) 0)) (not (= 2 ~z~0))) (or (not (= ~z$w_buff0~0 2)) (= (mod ~z$r_buff0_thd2~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= ~z$w_buff1~0 2)) (or (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0))] [2022-03-15 17:55:14,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:55:14,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:55:14,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:55:14,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:55:14,762 INFO L87 Difference]: Start difference. First operand 239 states and 635 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:55:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:55:14,907 INFO L93 Difference]: Finished difference Result 235 states and 621 transitions. [2022-03-15 17:55:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:55:14,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 17:55:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:55:14,909 INFO L225 Difference]: With dead ends: 235 [2022-03-15 17:55:14,910 INFO L226 Difference]: Without dead ends: 235 [2022-03-15 17:55:14,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:55:14,910 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:55:14,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 8 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:55:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-03-15 17:55:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-03-15 17:55:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.6538461538461537) internal successors, (621), 234 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have 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:55:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 621 transitions. [2022-03-15 17:55:14,917 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 621 transitions. Word has length 15 [2022-03-15 17:55:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:55:14,917 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 621 transitions. [2022-03-15 17:55:14,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:55:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 621 transitions. [2022-03-15 17:55:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 17:55:14,918 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:14,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:14,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:55:14,918 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:14,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:14,919 INFO L85 PathProgramCache]: Analyzing trace with hash 909015895, now seen corresponding path program 1 times [2022-03-15 17:55:14,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:14,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912735919] [2022-03-15 17:55:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:14,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:55:14,996 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:55:14,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:55:14,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912735919] [2022-03-15 17:55:14,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912735919] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:55:14,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:55:14,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:55:14,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1348753347] [2022-03-15 17:55:14,997 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:55:15,000 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:55:15,008 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 63 transitions. [2022-03-15 17:55:15,008 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:55:15,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10229#(not (= 3 ~__unbuffered_cnt~0))] [2022-03-15 17:55:15,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:55:15,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:55:15,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:55:15,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:55:15,295 INFO L87 Difference]: Start difference. First operand 235 states and 621 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:55:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:55:15,404 INFO L93 Difference]: Finished difference Result 178 states and 411 transitions. [2022-03-15 17:55:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:55:15,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 17:55:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:55:15,406 INFO L225 Difference]: With dead ends: 178 [2022-03-15 17:55:15,406 INFO L226 Difference]: Without dead ends: 125 [2022-03-15 17:55:15,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:55:15,407 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:55:15,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:55:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-03-15 17:55:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-03-15 17:55:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.088709677419355) internal successors, (259), 124 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have 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:55:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 259 transitions. [2022-03-15 17:55:15,410 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 259 transitions. Word has length 15 [2022-03-15 17:55:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:55:15,411 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 259 transitions. [2022-03-15 17:55:15,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:55:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 259 transitions. [2022-03-15 17:55:15,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 17:55:15,411 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:15,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:15,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:55:15,412 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash 478388045, now seen corresponding path program 1 times [2022-03-15 17:55:15,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:15,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922386563] [2022-03-15 17:55:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:55:15,509 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:55:15,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:55:15,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922386563] [2022-03-15 17:55:15,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922386563] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:55:15,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:55:15,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:55:15,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [6443069] [2022-03-15 17:55:15,510 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:55:15,513 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:55:15,523 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 81 transitions. [2022-03-15 17:55:15,523 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:55:16,186 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10668#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:55:16,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:55:16,187 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:55:16,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:55:16,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:55:16,187 INFO L87 Difference]: Start difference. First operand 125 states and 259 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:55:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:55:16,286 INFO L93 Difference]: Finished difference Result 111 states and 229 transitions. [2022-03-15 17:55:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:55:16,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 18 [2022-03-15 17:55:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:55:16,287 INFO L225 Difference]: With dead ends: 111 [2022-03-15 17:55:16,287 INFO L226 Difference]: Without dead ends: 102 [2022-03-15 17:55:16,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:55:16,288 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:55:16,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 12 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:55:16,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-03-15 17:55:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-03-15 17:55:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.108910891089109) internal successors, (213), 101 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have 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:55:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 213 transitions. [2022-03-15 17:55:16,291 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 213 transitions. Word has length 18 [2022-03-15 17:55:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:55:16,292 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 213 transitions. [2022-03-15 17:55:16,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:55:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 213 transitions. [2022-03-15 17:55:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:55:16,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:55:16,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:16,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:55:16,293 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:55:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:55:16,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1045940439, now seen corresponding path program 1 times [2022-03-15 17:55:16,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:55:16,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801534253] [2022-03-15 17:55:16,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:55:16,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:55:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:55:16,341 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:55:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:55:16,406 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:55:16,406 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:55:16,407 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 17:55:16,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-03-15 17:55:16,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 17:55:16,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-03-15 17:55:16,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-03-15 17:55:16,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 17:55:16,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:55:16,411 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:55:16,415 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:55:16,415 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:55:16,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:55:16 BasicIcfg [2022-03-15 17:55:16,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:55:16,505 INFO L158 Benchmark]: Toolchain (without parser) took 21777.02ms. Allocated memory was 176.2MB in the beginning and 254.8MB in the end (delta: 78.6MB). Free memory was 153.5MB in the beginning and 96.0MB in the end (delta: 57.5MB). Peak memory consumption was 136.1MB. Max. memory is 8.0GB. [2022-03-15 17:55:16,505 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:55:16,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.45ms. Allocated memory is still 176.2MB. Free memory was 153.2MB in the beginning and 137.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. [2022-03-15 17:55:16,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.53ms. Allocated memory is still 176.2MB. Free memory was 137.0MB in the beginning and 133.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:55:16,506 INFO L158 Benchmark]: Boogie Preprocessor took 39.38ms. Allocated memory is still 176.2MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:55:16,506 INFO L158 Benchmark]: RCFGBuilder took 1034.15ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 131.5MB in the beginning and 136.9MB in the end (delta: -5.3MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-03-15 17:55:16,507 INFO L158 Benchmark]: TraceAbstraction took 20117.95ms. Allocated memory was 211.8MB in the beginning and 254.8MB in the end (delta: 43.0MB). Free memory was 136.3MB in the beginning and 96.0MB in the end (delta: 40.4MB). Peak memory consumption was 83.3MB. Max. memory is 8.0GB. [2022-03-15 17:55:16,508 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.16ms. Allocated memory is still 176.2MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.45ms. Allocated memory is still 176.2MB. Free memory was 153.2MB in the beginning and 137.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.53ms. Allocated memory is still 176.2MB. Free memory was 137.0MB in the beginning and 133.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.38ms. Allocated memory is still 176.2MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1034.15ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 131.5MB in the beginning and 136.9MB in the end (delta: -5.3MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 20117.95ms. Allocated memory was 211.8MB in the beginning and 254.8MB in the end (delta: 43.0MB). Free memory was 136.3MB in the beginning and 96.0MB in the end (delta: 40.4MB). Peak memory consumption was 83.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.1s, 123 PlacesBefore, 36 PlacesAfterwards, 115 TransitionsBefore, 26 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 5117 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2943, positive: 2769, positive conditional: 0, positive unconditional: 2769, negative: 174, negative conditional: 0, negative unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1201, positive: 1152, positive conditional: 0, positive unconditional: 1152, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2943, positive: 1617, positive conditional: 0, positive unconditional: 1617, negative: 125, negative conditional: 0, negative unconditional: 125, unknown: 1201, unknown conditional: 0, unknown unconditional: 1201] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1961, ((void *)0), P0, ((void *)0))=-1, t1961={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1962, ((void *)0), P1, ((void *)0))=0, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1963, ((void *)0), P2, ((void *)0))=1, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L792] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L853] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 825]: 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: 823]: 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: 821]: 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 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 526 IncrementalHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 31 mSDtfsCounter, 526 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 126 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:55:16,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...