/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 12:13:33,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 12:13:33,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 12:13:33,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 12:13:33,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 12:13:33,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 12:13:33,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 12:13:33,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 12:13:33,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 12:13:33,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 12:13:33,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 12:13:33,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 12:13:33,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 12:13:33,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 12:13:33,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 12:13:33,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 12:13:33,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 12:13:33,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 12:13:33,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 12:13:33,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 12:13:33,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 12:13:33,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 12:13:33,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 12:13:33,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 12:13:33,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 12:13:33,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 12:13:33,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 12:13:33,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 12:13:33,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 12:13:33,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 12:13:33,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 12:13:33,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 12:13:33,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 12:13:33,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 12:13:33,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 12:13:33,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 12:13:33,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 12:13:33,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 12:13:33,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 12:13:33,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 12:13:33,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 12:13:33,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-28 12:13:33,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 12:13:33,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 12:13:33,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 12:13:33,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 12:13:33,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 12:13:33,794 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 12:13:33,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 12:13:33,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 12:13:33,794 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 12:13:33,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 12:13:33,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 12:13:33,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 12:13:33,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 12:13:33,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 12:13:33,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 12:13:33,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 12:13:33,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 12:13:33,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 12:13:33,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 12:13:33,796 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 12:13:33,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 12:13:33,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 12:13:33,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 12:13:33,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 12:13:33,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 12:13:33,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 12:13:33,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 12:13:33,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 12:13:33,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 12:13:33,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 12:13:33,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 12:13:33,797 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 12:13:33,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 12:13:33,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-01-28 12:13:34,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 12:13:34,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 12:13:34,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 12:13:34,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 12:13:34,204 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 12:13:34,205 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2022-01-28 12:13:34,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad8217b4/353a495849254013b108d6c6ff18305c/FLAGcc1b465e9 [2022-01-28 12:13:34,908 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 12:13:34,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2022-01-28 12:13:34,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad8217b4/353a495849254013b108d6c6ff18305c/FLAGcc1b465e9 [2022-01-28 12:13:34,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad8217b4/353a495849254013b108d6c6ff18305c [2022-01-28 12:13:34,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 12:13:34,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 12:13:34,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 12:13:34,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 12:13:34,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 12:13:34,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:13:34" (1/1) ... [2022-01-28 12:13:34,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@524d1f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:34, skipping insertion in model container [2022-01-28 12:13:34,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:13:34" (1/1) ... [2022-01-28 12:13:34,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 12:13:34,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 12:13:35,137 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/mix043.opt.i[944,957] [2022-01-28 12:13:35,295 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 12:13:35,301 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 12:13:35,310 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/mix043.opt.i[944,957] [2022-01-28 12:13:35,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 12:13:35,373 INFO L208 MainTranslator]: Completed translation [2022-01-28 12:13:35,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35 WrapperNode [2022-01-28 12:13:35,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 12:13:35,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 12:13:35,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 12:13:35,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 12:13:35,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,442 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 299 [2022-01-28 12:13:35,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 12:13:35,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 12:13:35,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 12:13:35,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 12:13:35,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 12:13:35,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 12:13:35,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 12:13:35,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 12:13:35,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (1/1) ... [2022-01-28 12:13:35,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 12:13:35,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 12:13:35,514 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-01-28 12:13:35,517 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-01-28 12:13:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 12:13:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-28 12:13:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 12:13:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 12:13:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 12:13:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-28 12:13:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-28 12:13:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-28 12:13:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-28 12:13:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-28 12:13:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-28 12:13:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-28 12:13:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-28 12:13:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 12:13:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-28 12:13:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 12:13:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 12:13:35,555 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 12:13:35,657 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 12:13:35,658 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 12:13:36,099 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 12:13:36,345 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 12:13:36,345 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-28 12:13:36,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:13:36 BoogieIcfgContainer [2022-01-28 12:13:36,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 12:13:36,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 12:13:36,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 12:13:36,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 12:13:36,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:13:34" (1/3) ... [2022-01-28 12:13:36,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b813c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:13:36, skipping insertion in model container [2022-01-28 12:13:36,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:13:35" (2/3) ... [2022-01-28 12:13:36,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b813c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:13:36, skipping insertion in model container [2022-01-28 12:13:36,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:13:36" (3/3) ... [2022-01-28 12:13:36,353 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2022-01-28 12:13:36,356 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 12:13:36,356 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 12:13:36,356 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-28 12:13:36,356 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 12:13:36,384 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,385 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,385 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,385 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,385 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,385 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,385 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,385 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,386 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,387 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,387 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,387 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,387 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,387 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,387 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,387 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,387 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,387 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,388 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,389 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,389 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,389 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,389 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,389 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,389 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,389 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,390 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,390 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,390 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,390 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,390 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,390 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,391 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,392 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,392 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,392 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,392 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,392 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,392 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,392 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,392 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,393 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,393 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,393 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,393 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,393 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,393 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,393 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,393 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,394 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,394 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,394 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,396 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,396 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,396 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,396 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,397 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,397 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,397 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,397 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,397 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,397 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,397 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,397 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,397 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,398 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,398 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,398 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,398 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,398 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,398 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,399 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:13:36,400 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-28 12:13:36,430 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 12:13:36,435 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-28 12:13:36,435 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-28 12:13:36,444 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 138 transitions, 296 flow [2022-01-28 12:13:40,454 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 102753 states, 102750 states have (on average 4.435172749391728) internal successors, (455714), 102752 states have internal predecessors, (455714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:13:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 102753 states, 102750 states have (on average 4.435172749391728) internal successors, (455714), 102752 states have internal predecessors, (455714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:13:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-28 12:13:40,949 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:13:40,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:13:40,951 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:13:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:13:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash 13924752, now seen corresponding path program 1 times [2022-01-28 12:13:40,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:13:40,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218029076] [2022-01-28 12:13:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:13:40,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:13:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:13:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:13:41,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:13:41,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218029076] [2022-01-28 12:13:41,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218029076] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:13:41,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:13:41,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 12:13:41,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572452752] [2022-01-28 12:13:41,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:13:41,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 12:13:41,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:13:41,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 12:13:41,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 12:13:41,491 INFO L87 Difference]: Start difference. First operand has 102753 states, 102750 states have (on average 4.435172749391728) internal successors, (455714), 102752 states have internal predecessors, (455714), 0 states have call successors, (0), 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 36.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:13:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:13:43,919 INFO L93 Difference]: Finished difference Result 88641 states and 386246 transitions. [2022-01-28 12:13:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 12:13:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-01-28 12:13:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:13:45,254 INFO L225 Difference]: With dead ends: 88641 [2022-01-28 12:13:45,255 INFO L226 Difference]: Without dead ends: 73745 [2022-01-28 12:13:45,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 12:13:45,260 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 48 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:13:45,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 196 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:13:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73745 states. [2022-01-28 12:13:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73745 to 73745. [2022-01-28 12:13:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73745 states, 73744 states have (on average 4.390377522239097) internal successors, (323764), 73744 states have internal predecessors, (323764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:13:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73745 states to 73745 states and 323764 transitions. [2022-01-28 12:13:51,345 INFO L78 Accepts]: Start accepts. Automaton has 73745 states and 323764 transitions. Word has length 72 [2022-01-28 12:13:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:13:51,349 INFO L470 AbstractCegarLoop]: Abstraction has 73745 states and 323764 transitions. [2022-01-28 12:13:51,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:13:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 73745 states and 323764 transitions. [2022-01-28 12:13:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-28 12:13:51,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:13:51,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:13:51,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 12:13:51,483 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:13:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:13:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1549994696, now seen corresponding path program 1 times [2022-01-28 12:13:51,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:13:51,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519534970] [2022-01-28 12:13:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:13:51,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:13:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:13:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:13:51,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:13:51,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519534970] [2022-01-28 12:13:51,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519534970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:13:51,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:13:51,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 12:13:51,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478930134] [2022-01-28 12:13:51,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:13:51,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 12:13:51,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:13:51,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 12:13:51,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 12:13:51,798 INFO L87 Difference]: Start difference. First operand 73745 states and 323764 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:13:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:13:53,445 INFO L93 Difference]: Finished difference Result 82369 states and 359030 transitions. [2022-01-28 12:13:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-28 12:13:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-01-28 12:13:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:13:53,831 INFO L225 Difference]: With dead ends: 82369 [2022-01-28 12:13:53,831 INFO L226 Difference]: Without dead ends: 62769 [2022-01-28 12:13:53,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:13:53,839 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 176 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 12:13:53,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 680 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 12:13:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62769 states. [2022-01-28 12:13:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62769 to 62769. [2022-01-28 12:13:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62769 states, 62768 states have (on average 4.355595207749172) internal successors, (273392), 62768 states have internal predecessors, (273392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:13:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62769 states to 62769 states and 273392 transitions. [2022-01-28 12:13:57,925 INFO L78 Accepts]: Start accepts. Automaton has 62769 states and 273392 transitions. Word has length 87 [2022-01-28 12:13:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:13:57,927 INFO L470 AbstractCegarLoop]: Abstraction has 62769 states and 273392 transitions. [2022-01-28 12:13:57,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:13:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 62769 states and 273392 transitions. [2022-01-28 12:13:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-28 12:13:58,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:13:58,143 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:13:58,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 12:13:58,143 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:13:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:13:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1442485179, now seen corresponding path program 1 times [2022-01-28 12:13:58,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:13:58,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632861597] [2022-01-28 12:13:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:13:58,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:13:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:13:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:13:58,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:13:58,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632861597] [2022-01-28 12:13:58,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632861597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:13:58,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:13:58,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-28 12:13:58,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483330712] [2022-01-28 12:13:58,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:13:58,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-28 12:13:58,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:13:58,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-28 12:13:58,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-28 12:13:58,427 INFO L87 Difference]: Start difference. First operand 62769 states and 273392 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:13:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:13:59,831 INFO L93 Difference]: Finished difference Result 72471 states and 313642 transitions. [2022-01-28 12:13:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-28 12:13:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-01-28 12:13:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:14:00,743 INFO L225 Difference]: With dead ends: 72471 [2022-01-28 12:14:00,744 INFO L226 Difference]: Without dead ends: 60711 [2022-01-28 12:14:00,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-28 12:14:00,750 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 324 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 12:14:00,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 1035 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 12:14:00,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60711 states. [2022-01-28 12:14:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60711 to 60711. [2022-01-28 12:14:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60711 states, 60710 states have (on average 4.34343600724757) internal successors, (263690), 60710 states have internal predecessors, (263690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60711 states to 60711 states and 263690 transitions. [2022-01-28 12:14:04,274 INFO L78 Accepts]: Start accepts. Automaton has 60711 states and 263690 transitions. Word has length 91 [2022-01-28 12:14:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:14:04,275 INFO L470 AbstractCegarLoop]: Abstraction has 60711 states and 263690 transitions. [2022-01-28 12:14:04,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 60711 states and 263690 transitions. [2022-01-28 12:14:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-28 12:14:04,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:14:04,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:14:04,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-28 12:14:04,473 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:14:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:14:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash -410048412, now seen corresponding path program 1 times [2022-01-28 12:14:04,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:14:04,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116153640] [2022-01-28 12:14:04,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:14:04,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:14:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:14:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:14:04,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:14:04,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116153640] [2022-01-28 12:14:04,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116153640] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:14:04,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:14:04,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 12:14:04,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497709747] [2022-01-28 12:14:04,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:14:04,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 12:14:04,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:14:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 12:14:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 12:14:04,723 INFO L87 Difference]: Start difference. First operand 60711 states and 263690 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:14:05,840 INFO L93 Difference]: Finished difference Result 74823 states and 320880 transitions. [2022-01-28 12:14:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-28 12:14:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-01-28 12:14:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:14:06,616 INFO L225 Difference]: With dead ends: 74823 [2022-01-28 12:14:06,616 INFO L226 Difference]: Without dead ends: 55223 [2022-01-28 12:14:06,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:14:06,622 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 227 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:14:06,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 514 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:14:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55223 states. [2022-01-28 12:14:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55223 to 55223. [2022-01-28 12:14:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55223 states, 55222 states have (on average 4.278186230125675) internal successors, (236250), 55222 states have internal predecessors, (236250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55223 states to 55223 states and 236250 transitions. [2022-01-28 12:14:09,308 INFO L78 Accepts]: Start accepts. Automaton has 55223 states and 236250 transitions. Word has length 93 [2022-01-28 12:14:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:14:09,310 INFO L470 AbstractCegarLoop]: Abstraction has 55223 states and 236250 transitions. [2022-01-28 12:14:09,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 55223 states and 236250 transitions. [2022-01-28 12:14:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-28 12:14:09,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:14:09,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:14:09,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-28 12:14:09,496 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:14:09,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:14:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash 605914772, now seen corresponding path program 1 times [2022-01-28 12:14:09,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:14:09,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378722704] [2022-01-28 12:14:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:14:09,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:14:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:14:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:14:10,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:14:10,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378722704] [2022-01-28 12:14:10,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378722704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:14:10,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:14:10,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 12:14:10,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167359860] [2022-01-28 12:14:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:14:10,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 12:14:10,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:14:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 12:14:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-28 12:14:10,071 INFO L87 Difference]: Start difference. First operand 55223 states and 236250 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:14:10,690 INFO L93 Difference]: Finished difference Result 56495 states and 235832 transitions. [2022-01-28 12:14:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-28 12:14:10,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-01-28 12:14:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:14:11,238 INFO L225 Difference]: With dead ends: 56495 [2022-01-28 12:14:11,238 INFO L226 Difference]: Without dead ends: 39695 [2022-01-28 12:14:11,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-01-28 12:14:11,239 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 405 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:14:11,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 609 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:14:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39695 states. [2022-01-28 12:14:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39695 to 39695. [2022-01-28 12:14:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39695 states, 39694 states have (on average 4.126215548949463) internal successors, (163786), 39694 states have internal predecessors, (163786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39695 states to 39695 states and 163786 transitions. [2022-01-28 12:14:12,895 INFO L78 Accepts]: Start accepts. Automaton has 39695 states and 163786 transitions. Word has length 94 [2022-01-28 12:14:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:14:12,895 INFO L470 AbstractCegarLoop]: Abstraction has 39695 states and 163786 transitions. [2022-01-28 12:14:12,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 39695 states and 163786 transitions. [2022-01-28 12:14:12,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-01-28 12:14:12,990 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:14:12,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:14:12,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-28 12:14:12,997 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:14:12,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:14:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash -521200802, now seen corresponding path program 1 times [2022-01-28 12:14:12,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:14:13,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549961029] [2022-01-28 12:14:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:14:13,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:14:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:14:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:14:13,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:14:13,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549961029] [2022-01-28 12:14:13,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549961029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:14:13,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:14:13,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 12:14:13,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696098489] [2022-01-28 12:14:13,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:14:13,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 12:14:13,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:14:13,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 12:14:13,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-28 12:14:13,742 INFO L87 Difference]: Start difference. First operand 39695 states and 163786 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:14:14,389 INFO L93 Difference]: Finished difference Result 59861 states and 246041 transitions. [2022-01-28 12:14:14,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 12:14:14,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-01-28 12:14:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:14:15,316 INFO L225 Difference]: With dead ends: 59861 [2022-01-28 12:14:15,317 INFO L226 Difference]: Without dead ends: 43160 [2022-01-28 12:14:15,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:14:15,319 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 148 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:14:15,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 1032 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:14:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2022-01-28 12:14:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 39695. [2022-01-28 12:14:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39695 states, 39694 states have (on average 4.079659394366907) internal successors, (161938), 39694 states have internal predecessors, (161938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39695 states to 39695 states and 161938 transitions. [2022-01-28 12:14:17,247 INFO L78 Accepts]: Start accepts. Automaton has 39695 states and 161938 transitions. Word has length 98 [2022-01-28 12:14:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:14:17,247 INFO L470 AbstractCegarLoop]: Abstraction has 39695 states and 161938 transitions. [2022-01-28 12:14:17,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 39695 states and 161938 transitions. [2022-01-28 12:14:17,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-01-28 12:14:17,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:14:17,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:14:17,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-28 12:14:17,780 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:14:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:14:17,782 INFO L85 PathProgramCache]: Analyzing trace with hash 451661780, now seen corresponding path program 2 times [2022-01-28 12:14:17,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:14:17,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471490768] [2022-01-28 12:14:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:14:17,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:14:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:14:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:14:18,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:14:18,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471490768] [2022-01-28 12:14:18,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471490768] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:14:18,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:14:18,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-28 12:14:18,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835202553] [2022-01-28 12:14:18,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:14:18,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-28 12:14:18,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:14:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-28 12:14:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-28 12:14:18,074 INFO L87 Difference]: Start difference. First operand 39695 states and 161938 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:14:18,514 INFO L93 Difference]: Finished difference Result 33224 states and 132268 transitions. [2022-01-28 12:14:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-28 12:14:18,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-01-28 12:14:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:14:18,607 INFO L225 Difference]: With dead ends: 33224 [2022-01-28 12:14:18,608 INFO L226 Difference]: Without dead ends: 23504 [2022-01-28 12:14:18,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-01-28 12:14:18,609 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 482 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:14:18,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 636 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:14:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23504 states. [2022-01-28 12:14:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23504 to 23504. [2022-01-28 12:14:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23504 states, 23503 states have (on average 3.93860358252138) internal successors, (92569), 23503 states have internal predecessors, (92569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23504 states to 23504 states and 92569 transitions. [2022-01-28 12:14:19,620 INFO L78 Accepts]: Start accepts. Automaton has 23504 states and 92569 transitions. Word has length 98 [2022-01-28 12:14:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:14:19,620 INFO L470 AbstractCegarLoop]: Abstraction has 23504 states and 92569 transitions. [2022-01-28 12:14:19,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 23504 states and 92569 transitions. [2022-01-28 12:14:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-28 12:14:19,676 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:14:19,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:14:19,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-28 12:14:19,676 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:14:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:14:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1589687278, now seen corresponding path program 1 times [2022-01-28 12:14:19,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:14:19,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872642709] [2022-01-28 12:14:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:14:19,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:14:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:14:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:14:19,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:14:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872642709] [2022-01-28 12:14:19,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872642709] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:14:19,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:14:19,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 12:14:19,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798180061] [2022-01-28 12:14:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:14:19,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 12:14:19,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:14:19,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 12:14:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-28 12:14:19,821 INFO L87 Difference]: Start difference. First operand 23504 states and 92569 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:14:20,836 INFO L93 Difference]: Finished difference Result 36098 states and 140714 transitions. [2022-01-28 12:14:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 12:14:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-01-28 12:14:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:14:20,938 INFO L225 Difference]: With dead ends: 36098 [2022-01-28 12:14:20,938 INFO L226 Difference]: Without dead ends: 23345 [2022-01-28 12:14:20,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:14:20,939 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 146 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 12:14:20,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 1050 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 12:14:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23345 states. [2022-01-28 12:14:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23345 to 22589. [2022-01-28 12:14:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22589 states, 22588 states have (on average 3.853506286523818) internal successors, (87043), 22588 states have internal predecessors, (87043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22589 states to 22589 states and 87043 transitions. [2022-01-28 12:14:21,828 INFO L78 Accepts]: Start accepts. Automaton has 22589 states and 87043 transitions. Word has length 102 [2022-01-28 12:14:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:14:21,828 INFO L470 AbstractCegarLoop]: Abstraction has 22589 states and 87043 transitions. [2022-01-28 12:14:21,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 22589 states and 87043 transitions. [2022-01-28 12:14:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-28 12:14:21,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:14:21,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:14:21,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-28 12:14:21,896 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:14:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:14:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2098950584, now seen corresponding path program 2 times [2022-01-28 12:14:21,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:14:21,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057753348] [2022-01-28 12:14:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:14:21,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:14:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:14:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:14:22,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:14:22,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057753348] [2022-01-28 12:14:22,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057753348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:14:22,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:14:22,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-28 12:14:22,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575085697] [2022-01-28 12:14:22,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:14:22,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-28 12:14:22,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:14:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-28 12:14:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-28 12:14:22,014 INFO L87 Difference]: Start difference. First operand 22589 states and 87043 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:14:22,316 INFO L93 Difference]: Finished difference Result 18350 states and 70033 transitions. [2022-01-28 12:14:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-28 12:14:22,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-01-28 12:14:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:14:22,341 INFO L225 Difference]: With dead ends: 18350 [2022-01-28 12:14:22,341 INFO L226 Difference]: Without dead ends: 6090 [2022-01-28 12:14:22,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-01-28 12:14:22,342 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 635 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:14:22,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 653 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:14:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2022-01-28 12:14:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 6090. [2022-01-28 12:14:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6090 states, 6089 states have (on average 3.770569880111677) internal successors, (22959), 6089 states have internal predecessors, (22959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 22959 transitions. [2022-01-28 12:14:22,743 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 22959 transitions. Word has length 102 [2022-01-28 12:14:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:14:22,743 INFO L470 AbstractCegarLoop]: Abstraction has 6090 states and 22959 transitions. [2022-01-28 12:14:22,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 22959 transitions. [2022-01-28 12:14:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-28 12:14:22,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:14:22,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:14:22,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-28 12:14:22,756 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:14:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:14:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1448822672, now seen corresponding path program 1 times [2022-01-28 12:14:22,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:14:22,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333254047] [2022-01-28 12:14:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:14:22,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:14:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:14:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:14:22,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:14:22,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333254047] [2022-01-28 12:14:22,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333254047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:14:22,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:14:22,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 12:14:22,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559703779] [2022-01-28 12:14:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:14:22,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 12:14:22,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:14:22,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 12:14:22,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-28 12:14:22,871 INFO L87 Difference]: Start difference. First operand 6090 states and 22959 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:14:23,032 INFO L93 Difference]: Finished difference Result 8583 states and 32292 transitions. [2022-01-28 12:14:23,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 12:14:23,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-01-28 12:14:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:14:23,072 INFO L225 Difference]: With dead ends: 8583 [2022-01-28 12:14:23,072 INFO L226 Difference]: Without dead ends: 3942 [2022-01-28 12:14:23,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:14:23,073 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 92 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:14:23,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 830 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:14:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2022-01-28 12:14:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3942. [2022-01-28 12:14:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3941 states have (on average 3.663790916011165) internal successors, (14439), 3941 states have internal predecessors, (14439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 14439 transitions. [2022-01-28 12:14:23,173 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 14439 transitions. Word has length 107 [2022-01-28 12:14:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:14:23,174 INFO L470 AbstractCegarLoop]: Abstraction has 3942 states and 14439 transitions. [2022-01-28 12:14:23,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 14439 transitions. [2022-01-28 12:14:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-28 12:14:23,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:14:23,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:14:23,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-28 12:14:23,183 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:14:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:14:23,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1259688882, now seen corresponding path program 2 times [2022-01-28 12:14:23,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:14:23,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72692207] [2022-01-28 12:14:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:14:23,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:14:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:14:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:14:23,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:14:23,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72692207] [2022-01-28 12:14:23,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72692207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:14:23,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:14:23,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-28 12:14:23,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905344867] [2022-01-28 12:14:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:14:23,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-28 12:14:23,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:14:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-28 12:14:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-28 12:14:23,432 INFO L87 Difference]: Start difference. First operand 3942 states and 14439 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:14:23,604 INFO L93 Difference]: Finished difference Result 5955 states and 21868 transitions. [2022-01-28 12:14:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-28 12:14:23,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-01-28 12:14:23,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:14:23,616 INFO L225 Difference]: With dead ends: 5955 [2022-01-28 12:14:23,616 INFO L226 Difference]: Without dead ends: 2934 [2022-01-28 12:14:23,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-01-28 12:14:23,618 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 270 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:14:23,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 847 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:14:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2022-01-28 12:14:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2934. [2022-01-28 12:14:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2933 states have (on average 3.540061370610297) internal successors, (10383), 2933 states have internal predecessors, (10383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 10383 transitions. [2022-01-28 12:14:23,676 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 10383 transitions. Word has length 107 [2022-01-28 12:14:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:14:23,676 INFO L470 AbstractCegarLoop]: Abstraction has 2934 states and 10383 transitions. [2022-01-28 12:14:23,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:14:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 10383 transitions. [2022-01-28 12:14:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-28 12:14:23,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:14:23,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:14:23,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-28 12:14:23,682 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-28 12:14:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:14:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1277795692, now seen corresponding path program 3 times [2022-01-28 12:14:23,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:14:23,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578260182] [2022-01-28 12:14:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:14:23,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:14:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-28 12:14:23,745 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-28 12:14:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-28 12:14:23,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-28 12:14:23,835 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-28 12:14:23,836 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-28 12:14:23,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-28 12:14:23,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-28 12:14:23,838 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-28 12:14:23,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-28 12:14:23,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-28 12:14:23,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-28 12:14:23,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-28 12:14:23,842 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2022-01-28 12:14:23,845 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-28 12:14:23,845 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-28 12:14:24,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:14:24 BasicIcfg [2022-01-28 12:14:24,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-28 12:14:24,241 INFO L158 Benchmark]: Toolchain (without parser) took 49272.37ms. Allocated memory was 179.3MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 153.8MB in the beginning and 7.5GB in the end (delta: -7.3GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2022-01-28 12:14:24,241 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-28 12:14:24,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.23ms. Allocated memory was 179.3MB in the beginning and 219.2MB in the end (delta: 39.8MB). Free memory was 153.8MB in the beginning and 177.9MB in the end (delta: -24.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-28 12:14:24,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.19ms. Allocated memory is still 219.2MB. Free memory was 177.9MB in the beginning and 175.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-28 12:14:24,241 INFO L158 Benchmark]: Boogie Preprocessor took 23.10ms. Allocated memory is still 219.2MB. Free memory was 175.2MB in the beginning and 172.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-28 12:14:24,241 INFO L158 Benchmark]: RCFGBuilder took 880.57ms. Allocated memory is still 219.2MB. Free memory was 172.7MB in the beginning and 156.5MB in the end (delta: 16.3MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. [2022-01-28 12:14:24,242 INFO L158 Benchmark]: TraceAbstraction took 47891.95ms. Allocated memory was 219.2MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 155.9MB in the beginning and 7.5GB in the end (delta: -7.3GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2022-01-28 12:14:24,243 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.10ms. Allocated memory is still 179.3MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 404.23ms. Allocated memory was 179.3MB in the beginning and 219.2MB in the end (delta: 39.8MB). Free memory was 153.8MB in the beginning and 177.9MB in the end (delta: -24.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.19ms. Allocated memory is still 219.2MB. Free memory was 177.9MB in the beginning and 175.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.10ms. Allocated memory is still 219.2MB. Free memory was 175.2MB in the beginning and 172.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 880.57ms. Allocated memory is still 219.2MB. Free memory was 172.7MB in the beginning and 156.5MB in the end (delta: 16.3MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. * TraceAbstraction took 47891.95ms. Allocated memory was 219.2MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 155.9MB in the beginning and 7.5GB in the end (delta: -7.3GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L848] 0 pthread_t t1133; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L849] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1133, ((void *)0), P0, ((void *)0))=-3, t1133={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 0 pthread_t t1134; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={5:0}, t1134={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L851] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1134, ((void *)0), P1, ((void *)0))=-2, t1133={5:0}, t1134={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L852] 0 pthread_t t1135; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L853] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1135, ((void *)0), P2, ((void *)0))=-1, t1133={5:0}, t1134={6:0}, t1135={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L854] 0 pthread_t t1136; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L855] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1136, ((void *)0), P3, ((void *)0))=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L817] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L784] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L787] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L790] 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) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] 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) [L790] 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) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 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 [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 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 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L861] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L861] 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) [L861] 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) [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L863] 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 [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L865] 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 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 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) [L872] 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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 853]: 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: 855]: 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: 851]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 47.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2953 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2953 mSDsluCounter, 8082 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6801 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 1795 mSDtfsCounter, 1200 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102753occurred in iteration=0, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 4221 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 3777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-01-28 12:14:24,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...