/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/mix046_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 16:56:06,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 16:56:06,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 16:56:06,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 16:56:06,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 16:56:06,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 16:56:06,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 16:56:06,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 16:56:06,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 16:56:06,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 16:56:06,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 16:56:06,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 16:56:06,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 16:56:06,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 16:56:06,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 16:56:06,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 16:56:06,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 16:56:06,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 16:56:06,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 16:56:06,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 16:56:06,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 16:56:06,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 16:56:06,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 16:56:06,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 16:56:06,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 16:56:06,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 16:56:06,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 16:56:06,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 16:56:06,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 16:56:06,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 16:56:06,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 16:56:06,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 16:56:06,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 16:56:06,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 16:56:06,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 16:56:06,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 16:56:06,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 16:56:06,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 16:56:06,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 16:56:06,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 16:56:06,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 16:56:06,643 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 [2021-06-12 16:56:06,697 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 16:56:06,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 16:56:06,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 16:56:06,697 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 16:56:06,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 16:56:06,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 16:56:06,700 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 16:56:06,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 16:56:06,700 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 16:56:06,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 16:56:06,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 16:56:06,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 16:56:06,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 16:56:06,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 16:56:06,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 16:56:06,702 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 16:56:06,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 16:56:06,702 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 16:56:06,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 16:56:06,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 16:56:06,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 16:56:06,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 16:56:06,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 16:56:06,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 16:56:06,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 16:56:06,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 16:56:06,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 16:56:06,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 16:56:06,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 16:56:06,704 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 16:56:06,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 16:56:06,704 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 [2021-06-12 16:56:06,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 16:56:07,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 16:56:07,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 16:56:07,018 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 16:56:07,018 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 16:56:07,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2021-06-12 16:56:07,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3426c849c/b647a8b3db25436ca5669c3ca87767b5/FLAGfa56f1080 [2021-06-12 16:56:07,619 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 16:56:07,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2021-06-12 16:56:07,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3426c849c/b647a8b3db25436ca5669c3ca87767b5/FLAGfa56f1080 [2021-06-12 16:56:08,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3426c849c/b647a8b3db25436ca5669c3ca87767b5 [2021-06-12 16:56:08,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 16:56:08,079 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 16:56:08,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 16:56:08,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 16:56:08,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 16:56:08,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0c01f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08, skipping insertion in model container [2021-06-12 16:56:08,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 16:56:08,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 16:56:08,273 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i[948,961] [2021-06-12 16:56:08,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 16:56:08,491 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 16:56:08,499 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i[948,961] [2021-06-12 16:56:08,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 16:56:08,599 INFO L208 MainTranslator]: Completed translation [2021-06-12 16:56:08,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08 WrapperNode [2021-06-12 16:56:08,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 16:56:08,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 16:56:08,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 16:56:08,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 16:56:08,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 16:56:08,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 16:56:08,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 16:56:08,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 16:56:08,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... [2021-06-12 16:56:08,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 16:56:08,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 16:56:08,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 16:56:08,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 16:56:08,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 16:56:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 16:56:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-12 16:56:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 16:56:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 16:56:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-12 16:56:08,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-12 16:56:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-12 16:56:08,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-12 16:56:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-12 16:56:08,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-12 16:56:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-12 16:56:08,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-12 16:56:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 16:56:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-12 16:56:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 16:56:08,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 16:56:08,793 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 16:56:10,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 16:56:10,357 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-12 16:56:10,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 04:56:10 BoogieIcfgContainer [2021-06-12 16:56:10,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 16:56:10,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 16:56:10,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 16:56:10,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 16:56:10,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 04:56:08" (1/3) ... [2021-06-12 16:56:10,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398e4d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 04:56:10, skipping insertion in model container [2021-06-12 16:56:10,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:56:08" (2/3) ... [2021-06-12 16:56:10,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398e4d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 04:56:10, skipping insertion in model container [2021-06-12 16:56:10,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 04:56:10" (3/3) ... [2021-06-12 16:56:10,366 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2021-06-12 16:56:10,371 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 16:56:10,372 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 16:56:10,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-12 16:56:10,372 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 16:56:10,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,410 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,413 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,413 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,414 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,414 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,416 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,416 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,417 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,417 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,420 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,420 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,421 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,421 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,421 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,421 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,422 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,422 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,430 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,436 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,436 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,438 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,443 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,448 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,450 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,450 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:56:10,451 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-12 16:56:10,470 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 16:56:10,485 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:56:10,485 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:56:10,486 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:56:10,486 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:56:10,486 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:56:10,486 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:56:10,486 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:56:10,486 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P3======== [2021-06-12 16:56:10,496 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow [2021-06-12 16:56:38,266 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 128229 states, 128225 states have (on average 4.505681419379996) internal successors, (577741), 128228 states have internal predecessors, (577741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:56:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 128229 states, 128225 states have (on average 4.505681419379996) internal successors, (577741), 128228 states have internal predecessors, (577741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:56:39,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 16:56:39,450 INFO L301 ceAbstractionStarter]: Result for error location P3 was SAFE (1/3) [2021-06-12 16:56:39,452 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-12 16:56:39,454 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:56:39,454 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:56:39,454 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:56:39,455 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:56:39,455 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:56:39,455 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:56:39,455 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:56:39,455 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 16:56:39,464 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow [2021-06-12 16:57:04,817 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 128229 states, 128225 states have (on average 4.505681419379996) internal successors, (577741), 128228 states have internal predecessors, (577741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 128229 states, 128225 states have (on average 4.505681419379996) internal successors, (577741), 128228 states have internal predecessors, (577741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-12 16:57:05,178 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:05,179 INFO L472 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] [2021-06-12 16:57:05,180 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:05,184 INFO L82 PathProgramCache]: Analyzing trace with hash -317353279, now seen corresponding path program 1 times [2021-06-12 16:57:05,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:05,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789412984] [2021-06-12 16:57:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:05,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:05,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789412984] [2021-06-12 16:57:05,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789412984] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:05,703 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:05,703 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:57:05,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545537302] [2021-06-12 16:57:05,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:57:05,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:57:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:57:05,928 INFO L87 Difference]: Start difference. First operand has 128229 states, 128225 states have (on average 4.505681419379996) internal successors, (577741), 128228 states have internal predecessors, (577741), 0 states have call successors, (0), 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 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:08,798 INFO L93 Difference]: Finished difference Result 157629 states and 695810 transitions. [2021-06-12 16:57:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:57:08,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-12 16:57:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:09,438 INFO L225 Difference]: With dead ends: 157629 [2021-06-12 16:57:09,438 INFO L226 Difference]: Without dead ends: 52573 [2021-06-12 16:57:09,439 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 98.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:57:09,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52573 states. [2021-06-12 16:57:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52573 to 52573. [2021-06-12 16:57:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52573 states, 52572 states have (on average 4.332914859621091) internal successors, (227790), 52572 states have internal predecessors, (227790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52573 states to 52573 states and 227790 transitions. [2021-06-12 16:57:12,448 INFO L78 Accepts]: Start accepts. Automaton has 52573 states and 227790 transitions. Word has length 80 [2021-06-12 16:57:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:12,450 INFO L482 AbstractCegarLoop]: Abstraction has 52573 states and 227790 transitions. [2021-06-12 16:57:12,450 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 52573 states and 227790 transitions. [2021-06-12 16:57:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-12 16:57:12,722 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:12,722 INFO L472 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] [2021-06-12 16:57:12,723 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 16:57:12,723 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash 492269220, now seen corresponding path program 1 times [2021-06-12 16:57:12,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:12,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111772942] [2021-06-12 16:57:12,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:12,942 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:12,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111772942] [2021-06-12 16:57:12,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111772942] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:12,942 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:12,942 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-12 16:57:12,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086658290] [2021-06-12 16:57:12,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-12 16:57:12,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:12,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-12 16:57:12,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:57:12,945 INFO L87 Difference]: Start difference. First operand 52573 states and 227790 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:14,217 INFO L93 Difference]: Finished difference Result 63437 states and 273614 transitions. [2021-06-12 16:57:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 16:57:14,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-06-12 16:57:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:14,642 INFO L225 Difference]: With dead ends: 63437 [2021-06-12 16:57:14,642 INFO L226 Difference]: Without dead ends: 53245 [2021-06-12 16:57:14,643 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 347.5ms TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2021-06-12 16:57:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53245 states. [2021-06-12 16:57:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53245 to 51453. [2021-06-12 16:57:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51453 states, 51452 states have (on average 4.317694161548628) internal successors, (222154), 51452 states have internal predecessors, (222154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51453 states to 51453 states and 222154 transitions. [2021-06-12 16:57:16,924 INFO L78 Accepts]: Start accepts. Automaton has 51453 states and 222154 transitions. Word has length 84 [2021-06-12 16:57:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:16,925 INFO L482 AbstractCegarLoop]: Abstraction has 51453 states and 222154 transitions. [2021-06-12 16:57:16,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 51453 states and 222154 transitions. [2021-06-12 16:57:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-12 16:57:17,306 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:17,306 INFO L472 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] [2021-06-12 16:57:17,307 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 16:57:17,307 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:17,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1729629605, now seen corresponding path program 1 times [2021-06-12 16:57:17,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:17,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571571898] [2021-06-12 16:57:17,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:17,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:17,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571571898] [2021-06-12 16:57:17,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571571898] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:17,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:17,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 16:57:17,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522992526] [2021-06-12 16:57:17,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 16:57:17,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 16:57:17,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-12 16:57:17,532 INFO L87 Difference]: Start difference. First operand 51453 states and 222154 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:18,425 INFO L93 Difference]: Finished difference Result 62037 states and 266898 transitions. [2021-06-12 16:57:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 16:57:18,429 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-12 16:57:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:18,675 INFO L225 Difference]: With dead ends: 62037 [2021-06-12 16:57:18,675 INFO L226 Difference]: Without dead ends: 53637 [2021-06-12 16:57:18,675 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 340.6ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-06-12 16:57:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53637 states. [2021-06-12 16:57:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53637 to 53413. [2021-06-12 16:57:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53413 states, 53412 states have (on average 4.324908260316034) internal successors, (231002), 53412 states have internal predecessors, (231002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53413 states to 53413 states and 231002 transitions. [2021-06-12 16:57:20,685 INFO L78 Accepts]: Start accepts. Automaton has 53413 states and 231002 transitions. Word has length 86 [2021-06-12 16:57:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:20,686 INFO L482 AbstractCegarLoop]: Abstraction has 53413 states and 231002 transitions. [2021-06-12 16:57:20,686 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 53413 states and 231002 transitions. [2021-06-12 16:57:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-12 16:57:20,750 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:20,750 INFO L472 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] [2021-06-12 16:57:20,750 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 16:57:20,750 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash 476125495, now seen corresponding path program 2 times [2021-06-12 16:57:20,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:20,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616701177] [2021-06-12 16:57:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:21,279 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2021-06-12 16:57:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:21,368 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:21,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616701177] [2021-06-12 16:57:21,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616701177] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:21,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:21,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 16:57:21,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190865581] [2021-06-12 16:57:21,369 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 16:57:21,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 16:57:21,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-06-12 16:57:21,370 INFO L87 Difference]: Start difference. First operand 53413 states and 231002 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:22,175 INFO L93 Difference]: Finished difference Result 60553 states and 260124 transitions. [2021-06-12 16:57:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 16:57:22,176 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-12 16:57:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:22,387 INFO L225 Difference]: With dead ends: 60553 [2021-06-12 16:57:22,388 INFO L226 Difference]: Without dead ends: 52153 [2021-06-12 16:57:22,388 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 531.4ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-06-12 16:57:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52153 states. [2021-06-12 16:57:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52153 to 52153. [2021-06-12 16:57:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52153 states, 52152 states have (on average 4.316881423531217) internal successors, (225134), 52152 states have internal predecessors, (225134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52153 states to 52153 states and 225134 transitions. [2021-06-12 16:57:24,422 INFO L78 Accepts]: Start accepts. Automaton has 52153 states and 225134 transitions. Word has length 86 [2021-06-12 16:57:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:24,424 INFO L482 AbstractCegarLoop]: Abstraction has 52153 states and 225134 transitions. [2021-06-12 16:57:24,424 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 52153 states and 225134 transitions. [2021-06-12 16:57:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:57:24,509 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:24,510 INFO L472 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] [2021-06-12 16:57:24,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 16:57:24,510 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:24,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash -768095147, now seen corresponding path program 1 times [2021-06-12 16:57:24,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:24,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19411203] [2021-06-12 16:57:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:24,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:24,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19411203] [2021-06-12 16:57:24,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19411203] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:24,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:24,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 16:57:24,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343752551] [2021-06-12 16:57:24,758 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 16:57:24,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 16:57:24,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-12 16:57:24,762 INFO L87 Difference]: Start difference. First operand 52153 states and 225134 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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) [2021-06-12 16:57:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:25,741 INFO L93 Difference]: Finished difference Result 58327 states and 250418 transitions. [2021-06-12 16:57:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 16:57:25,742 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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 [2021-06-12 16:57:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:26,077 INFO L225 Difference]: With dead ends: 58327 [2021-06-12 16:57:26,077 INFO L226 Difference]: Without dead ends: 52447 [2021-06-12 16:57:26,078 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 176.9ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-12 16:57:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52447 states. [2021-06-12 16:57:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52447 to 50683. [2021-06-12 16:57:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50683 states, 50682 states have (on average 4.303421333017639) internal successors, (218106), 50682 states have internal predecessors, (218106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50683 states to 50683 states and 218106 transitions. [2021-06-12 16:57:28,435 INFO L78 Accepts]: Start accepts. Automaton has 50683 states and 218106 transitions. Word has length 87 [2021-06-12 16:57:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:28,435 INFO L482 AbstractCegarLoop]: Abstraction has 50683 states and 218106 transitions. [2021-06-12 16:57:28,435 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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) [2021-06-12 16:57:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 50683 states and 218106 transitions. [2021-06-12 16:57:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:57:28,503 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:28,503 INFO L472 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] [2021-06-12 16:57:28,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 16:57:28,503 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:28,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:28,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2021599257, now seen corresponding path program 2 times [2021-06-12 16:57:28,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:28,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090937603] [2021-06-12 16:57:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:28,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:28,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090937603] [2021-06-12 16:57:28,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090937603] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:28,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:28,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-12 16:57:28,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028215089] [2021-06-12 16:57:28,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-12 16:57:28,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-12 16:57:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:57:28,982 INFO L87 Difference]: Start difference. First operand 50683 states and 218106 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 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) [2021-06-12 16:57:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:29,582 INFO L93 Difference]: Finished difference Result 59699 states and 255759 transitions. [2021-06-12 16:57:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 16:57:29,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 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 [2021-06-12 16:57:29,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:30,021 INFO L225 Difference]: With dead ends: 59699 [2021-06-12 16:57:30,021 INFO L226 Difference]: Without dead ends: 53035 [2021-06-12 16:57:30,021 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 249.8ms TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-06-12 16:57:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53035 states. [2021-06-12 16:57:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53035 to 50977. [2021-06-12 16:57:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50977 states, 50976 states have (on average 4.310597143753923) internal successors, (219737), 50976 states have internal predecessors, (219737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50977 states to 50977 states and 219737 transitions. [2021-06-12 16:57:31,763 INFO L78 Accepts]: Start accepts. Automaton has 50977 states and 219737 transitions. Word has length 87 [2021-06-12 16:57:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:31,764 INFO L482 AbstractCegarLoop]: Abstraction has 50977 states and 219737 transitions. [2021-06-12 16:57:31,764 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 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) [2021-06-12 16:57:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 50977 states and 219737 transitions. [2021-06-12 16:57:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:57:31,831 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:31,831 INFO L472 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] [2021-06-12 16:57:31,831 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 16:57:31,831 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1329606822, now seen corresponding path program 1 times [2021-06-12 16:57:31,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:31,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943593844] [2021-06-12 16:57:31,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:32,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:32,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943593844] [2021-06-12 16:57:32,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943593844] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:32,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:32,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:57:32,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892651788] [2021-06-12 16:57:32,029 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:57:32,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:57:32,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:57:32,030 INFO L87 Difference]: Start difference. First operand 50977 states and 219737 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:32,830 INFO L93 Difference]: Finished difference Result 64991 states and 279727 transitions. [2021-06-12 16:57:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 16:57:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-12 16:57:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:33,269 INFO L225 Difference]: With dead ends: 64991 [2021-06-12 16:57:33,269 INFO L226 Difference]: Without dead ends: 60287 [2021-06-12 16:57:33,269 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 203.1ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-06-12 16:57:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60287 states. [2021-06-12 16:57:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60287 to 58523. [2021-06-12 16:57:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58523 states, 58522 states have (on average 4.30906325826185) internal successors, (252175), 58522 states have internal predecessors, (252175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58523 states to 58523 states and 252175 transitions. [2021-06-12 16:57:35,108 INFO L78 Accepts]: Start accepts. Automaton has 58523 states and 252175 transitions. Word has length 88 [2021-06-12 16:57:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:35,108 INFO L482 AbstractCegarLoop]: Abstraction has 58523 states and 252175 transitions. [2021-06-12 16:57:35,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 58523 states and 252175 transitions. [2021-06-12 16:57:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:57:35,188 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:35,188 INFO L472 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] [2021-06-12 16:57:35,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 16:57:35,188 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash 76102712, now seen corresponding path program 2 times [2021-06-12 16:57:35,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:35,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585085142] [2021-06-12 16:57:35,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:35,746 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:35,746 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585085142] [2021-06-12 16:57:35,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585085142] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:35,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:35,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:57:35,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287986103] [2021-06-12 16:57:35,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:57:35,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:35,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:57:35,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:57:35,748 INFO L87 Difference]: Start difference. First operand 58523 states and 252175 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:36,382 INFO L93 Difference]: Finished difference Result 65187 states and 279377 transitions. [2021-06-12 16:57:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 16:57:36,383 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-12 16:57:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:36,877 INFO L225 Difference]: With dead ends: 65187 [2021-06-12 16:57:36,878 INFO L226 Difference]: Without dead ends: 60483 [2021-06-12 16:57:36,878 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 567.8ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-06-12 16:57:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60483 states. [2021-06-12 16:57:38,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60483 to 58033. [2021-06-12 16:57:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58033 states, 58032 states have (on average 4.31577405569341) internal successors, (250453), 58032 states have internal predecessors, (250453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58033 states to 58033 states and 250453 transitions. [2021-06-12 16:57:38,668 INFO L78 Accepts]: Start accepts. Automaton has 58033 states and 250453 transitions. Word has length 88 [2021-06-12 16:57:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:38,668 INFO L482 AbstractCegarLoop]: Abstraction has 58033 states and 250453 transitions. [2021-06-12 16:57:38,668 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 58033 states and 250453 transitions. [2021-06-12 16:57:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:57:38,759 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:38,760 INFO L472 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] [2021-06-12 16:57:38,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 16:57:38,760 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash -555431712, now seen corresponding path program 3 times [2021-06-12 16:57:38,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:38,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520910537] [2021-06-12 16:57:38,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:39,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:39,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520910537] [2021-06-12 16:57:39,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520910537] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:39,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:39,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:57:39,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773712559] [2021-06-12 16:57:39,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:57:39,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:57:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:57:39,380 INFO L87 Difference]: Start difference. First operand 58033 states and 250453 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:40,243 INFO L93 Difference]: Finished difference Result 71655 states and 309085 transitions. [2021-06-12 16:57:40,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 16:57:40,245 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-12 16:57:40,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:40,536 INFO L225 Difference]: With dead ends: 71655 [2021-06-12 16:57:40,537 INFO L226 Difference]: Without dead ends: 66951 [2021-06-12 16:57:40,537 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 238.4ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-06-12 16:57:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66951 states. [2021-06-12 16:57:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66951 to 59895. [2021-06-12 16:57:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59895 states, 59894 states have (on average 4.323254416135172) internal successors, (258937), 59894 states have internal predecessors, (258937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59895 states to 59895 states and 258937 transitions. [2021-06-12 16:57:42,746 INFO L78 Accepts]: Start accepts. Automaton has 59895 states and 258937 transitions. Word has length 88 [2021-06-12 16:57:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:42,746 INFO L482 AbstractCegarLoop]: Abstraction has 59895 states and 258937 transitions. [2021-06-12 16:57:42,746 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 59895 states and 258937 transitions. [2021-06-12 16:57:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:57:42,852 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:42,852 INFO L472 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] [2021-06-12 16:57:42,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 16:57:42,853 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2008549280, now seen corresponding path program 4 times [2021-06-12 16:57:42,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:42,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229731188] [2021-06-12 16:57:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:43,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:43,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229731188] [2021-06-12 16:57:43,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229731188] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:43,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:43,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:57:43,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449714684] [2021-06-12 16:57:43,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:57:43,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:43,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:57:43,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:57:43,193 INFO L87 Difference]: Start difference. First operand 59895 states and 258937 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:43,906 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2021-06-12 16:57:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:44,117 INFO L93 Difference]: Finished difference Result 72635 states and 312529 transitions. [2021-06-12 16:57:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 16:57:44,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-12 16:57:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:44,355 INFO L225 Difference]: With dead ends: 72635 [2021-06-12 16:57:44,355 INFO L226 Difference]: Without dead ends: 67931 [2021-06-12 16:57:44,355 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 589.4ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-06-12 16:57:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67931 states. [2021-06-12 16:57:46,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67931 to 59797. [2021-06-12 16:57:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59797 states, 59796 states have (on average 4.324252458358418) internal successors, (258573), 59796 states have internal predecessors, (258573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59797 states to 59797 states and 258573 transitions. [2021-06-12 16:57:46,758 INFO L78 Accepts]: Start accepts. Automaton has 59797 states and 258573 transitions. Word has length 88 [2021-06-12 16:57:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:46,758 INFO L482 AbstractCegarLoop]: Abstraction has 59797 states and 258573 transitions. [2021-06-12 16:57:46,758 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 59797 states and 258573 transitions. [2021-06-12 16:57:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:57:46,889 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:46,889 INFO L472 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] [2021-06-12 16:57:46,889 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 16:57:46,889 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:46,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2128959258, now seen corresponding path program 5 times [2021-06-12 16:57:46,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:46,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599763796] [2021-06-12 16:57:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:47,374 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2021-06-12 16:57:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:47,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:47,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599763796] [2021-06-12 16:57:47,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599763796] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:47,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:47,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-12 16:57:47,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452578659] [2021-06-12 16:57:47,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-12 16:57:47,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:47,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-12 16:57:47,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:57:47,568 INFO L87 Difference]: Start difference. First operand 59797 states and 258573 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:48,905 INFO L93 Difference]: Finished difference Result 78221 states and 333767 transitions. [2021-06-12 16:57:48,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 16:57:48,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-12 16:57:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:49,353 INFO L225 Difference]: With dead ends: 78221 [2021-06-12 16:57:49,353 INFO L226 Difference]: Without dead ends: 61561 [2021-06-12 16:57:49,354 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 297.3ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-12 16:57:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61561 states. [2021-06-12 16:57:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61561 to 46861. [2021-06-12 16:57:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46861 states, 46860 states have (on average 4.263636363636364) internal successors, (199794), 46860 states have internal predecessors, (199794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46861 states to 46861 states and 199794 transitions. [2021-06-12 16:57:51,368 INFO L78 Accepts]: Start accepts. Automaton has 46861 states and 199794 transitions. Word has length 88 [2021-06-12 16:57:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:51,368 INFO L482 AbstractCegarLoop]: Abstraction has 46861 states and 199794 transitions. [2021-06-12 16:57:51,368 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 46861 states and 199794 transitions. [2021-06-12 16:57:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:57:51,441 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:51,442 INFO L472 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] [2021-06-12 16:57:51,442 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 16:57:51,442 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1828514552, now seen corresponding path program 1 times [2021-06-12 16:57:51,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:51,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192740385] [2021-06-12 16:57:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:51,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:51,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192740385] [2021-06-12 16:57:51,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192740385] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:51,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:51,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:57:51,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533766048] [2021-06-12 16:57:51,527 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:57:51,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:57:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:57:51,528 INFO L87 Difference]: Start difference. First operand 46861 states and 199794 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:52,325 INFO L93 Difference]: Finished difference Result 58845 states and 247658 transitions. [2021-06-12 16:57:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:57:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-12 16:57:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:52,467 INFO L225 Difference]: With dead ends: 58845 [2021-06-12 16:57:52,467 INFO L226 Difference]: Without dead ends: 43165 [2021-06-12 16:57:52,468 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:57:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43165 states. [2021-06-12 16:57:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43165 to 43165. [2021-06-12 16:57:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43165 states, 43164 states have (on average 4.202807895468446) internal successors, (181410), 43164 states have internal predecessors, (181410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43165 states to 43165 states and 181410 transitions. [2021-06-12 16:57:53,849 INFO L78 Accepts]: Start accepts. Automaton has 43165 states and 181410 transitions. Word has length 88 [2021-06-12 16:57:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:53,850 INFO L482 AbstractCegarLoop]: Abstraction has 43165 states and 181410 transitions. [2021-06-12 16:57:53,850 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 43165 states and 181410 transitions. [2021-06-12 16:57:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-12 16:57:53,920 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:53,920 INFO L472 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] [2021-06-12 16:57:53,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 16:57:53,920 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash 979302168, now seen corresponding path program 1 times [2021-06-12 16:57:53,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:53,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998746802] [2021-06-12 16:57:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:54,006 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:54,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998746802] [2021-06-12 16:57:54,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998746802] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:54,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:54,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:57:54,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629665089] [2021-06-12 16:57:54,007 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:57:54,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:54,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:57:54,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:57:54,008 INFO L87 Difference]: Start difference. First operand 43165 states and 181410 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:54,763 INFO L93 Difference]: Finished difference Result 46201 states and 189818 transitions. [2021-06-12 16:57:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 16:57:54,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-12 16:57:54,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:54,949 INFO L225 Difference]: With dead ends: 46201 [2021-06-12 16:57:54,949 INFO L226 Difference]: Without dead ends: 32761 [2021-06-12 16:57:54,950 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 90.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:57:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32761 states. [2021-06-12 16:57:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32761 to 32761. [2021-06-12 16:57:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32761 states, 32760 states have (on average 4.068681318681318) internal successors, (133290), 32760 states have internal predecessors, (133290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32761 states to 32761 states and 133290 transitions. [2021-06-12 16:57:55,871 INFO L78 Accepts]: Start accepts. Automaton has 32761 states and 133290 transitions. Word has length 89 [2021-06-12 16:57:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:55,872 INFO L482 AbstractCegarLoop]: Abstraction has 32761 states and 133290 transitions. [2021-06-12 16:57:55,872 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 32761 states and 133290 transitions. [2021-06-12 16:57:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-12 16:57:55,922 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:55,922 INFO L472 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] [2021-06-12 16:57:55,922 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 16:57:55,922 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:55,923 INFO L82 PathProgramCache]: Analyzing trace with hash -102719173, now seen corresponding path program 1 times [2021-06-12 16:57:55,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:55,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141513348] [2021-06-12 16:57:55,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:56,001 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:56,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141513348] [2021-06-12 16:57:56,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141513348] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:56,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:56,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:57:56,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220815624] [2021-06-12 16:57:56,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:57:56,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:56,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:57:56,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:57:56,002 INFO L87 Difference]: Start difference. First operand 32761 states and 133290 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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) [2021-06-12 16:57:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:56,800 INFO L93 Difference]: Finished difference Result 52207 states and 210170 transitions. [2021-06-12 16:57:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:57:56,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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 [2021-06-12 16:57:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:56,904 INFO L225 Difference]: With dead ends: 52207 [2021-06-12 16:57:56,905 INFO L226 Difference]: Without dead ends: 34165 [2021-06-12 16:57:56,905 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:57:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34165 states. [2021-06-12 16:57:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34165 to 31789. [2021-06-12 16:57:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31789 states, 31788 states have (on average 3.986221215553039) internal successors, (126714), 31788 states have internal predecessors, (126714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31789 states to 31789 states and 126714 transitions. [2021-06-12 16:57:57,841 INFO L78 Accepts]: Start accepts. Automaton has 31789 states and 126714 transitions. Word has length 91 [2021-06-12 16:57:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:57,841 INFO L482 AbstractCegarLoop]: Abstraction has 31789 states and 126714 transitions. [2021-06-12 16:57:57,841 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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) [2021-06-12 16:57:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 31789 states and 126714 transitions. [2021-06-12 16:57:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-12 16:57:57,891 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:57,891 INFO L472 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] [2021-06-12 16:57:57,891 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 16:57:57,891 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:57,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash 348360455, now seen corresponding path program 1 times [2021-06-12 16:57:57,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:57,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559430274] [2021-06-12 16:57:57,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:57,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:57,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559430274] [2021-06-12 16:57:57,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559430274] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:57,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:57,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 16:57:57,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086839386] [2021-06-12 16:57:57,991 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 16:57:57,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:57,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 16:57:57,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-12 16:57:57,992 INFO L87 Difference]: Start difference. First operand 31789 states and 126714 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:58,565 INFO L93 Difference]: Finished difference Result 28873 states and 112719 transitions. [2021-06-12 16:57:58,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 16:57:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-06-12 16:57:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:58,616 INFO L225 Difference]: With dead ends: 28873 [2021-06-12 16:57:58,617 INFO L226 Difference]: Without dead ends: 20845 [2021-06-12 16:57:58,617 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 104.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-12 16:57:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20845 states. [2021-06-12 16:57:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20845 to 20845. [2021-06-12 16:57:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20845 states, 20844 states have (on average 3.865284974093264) internal successors, (80568), 20844 states have internal predecessors, (80568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20845 states to 20845 states and 80568 transitions. [2021-06-12 16:57:59,241 INFO L78 Accepts]: Start accepts. Automaton has 20845 states and 80568 transitions. Word has length 92 [2021-06-12 16:57:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:57:59,241 INFO L482 AbstractCegarLoop]: Abstraction has 20845 states and 80568 transitions. [2021-06-12 16:57:59,241 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 20845 states and 80568 transitions. [2021-06-12 16:57:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-06-12 16:57:59,274 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:57:59,274 INFO L472 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] [2021-06-12 16:57:59,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 16:57:59,274 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:57:59,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:57:59,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1689155465, now seen corresponding path program 1 times [2021-06-12 16:57:59,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:57:59,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711557189] [2021-06-12 16:57:59,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:57:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:57:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:57:59,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:57:59,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711557189] [2021-06-12 16:57:59,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711557189] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:57:59,382 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:57:59,382 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:57:59,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788778236] [2021-06-12 16:57:59,382 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:57:59,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:57:59,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:57:59,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:57:59,383 INFO L87 Difference]: Start difference. First operand 20845 states and 80568 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:57:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:57:59,624 INFO L93 Difference]: Finished difference Result 28861 states and 111139 transitions. [2021-06-12 16:57:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 16:57:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-06-12 16:57:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:57:59,666 INFO L225 Difference]: With dead ends: 28861 [2021-06-12 16:57:59,666 INFO L226 Difference]: Without dead ends: 13595 [2021-06-12 16:57:59,666 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:57:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13595 states. [2021-06-12 16:58:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13595 to 13595. [2021-06-12 16:58:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13595 states, 13594 states have (on average 3.7831396204207737) internal successors, (51428), 13594 states have internal predecessors, (51428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13595 states to 13595 states and 51428 transitions. [2021-06-12 16:58:00,118 INFO L78 Accepts]: Start accepts. Automaton has 13595 states and 51428 transitions. Word has length 96 [2021-06-12 16:58:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:58:00,118 INFO L482 AbstractCegarLoop]: Abstraction has 13595 states and 51428 transitions. [2021-06-12 16:58:00,118 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:00,118 INFO L276 IsEmpty]: Start isEmpty. Operand 13595 states and 51428 transitions. [2021-06-12 16:58:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-06-12 16:58:00,136 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:58:00,136 INFO L472 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] [2021-06-12 16:58:00,136 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 16:58:00,136 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:58:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:58:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2140712001, now seen corresponding path program 2 times [2021-06-12 16:58:00,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:58:00,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169519638] [2021-06-12 16:58:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:58:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:58:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:58:00,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:58:00,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169519638] [2021-06-12 16:58:00,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169519638] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:58:00,241 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:58:00,241 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-12 16:58:00,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294554272] [2021-06-12 16:58:00,242 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-12 16:58:00,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:58:00,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-12 16:58:00,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-12 16:58:00,242 INFO L87 Difference]: Start difference. First operand 13595 states and 51428 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:58:00,466 INFO L93 Difference]: Finished difference Result 11165 states and 41627 transitions. [2021-06-12 16:58:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 16:58:00,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-06-12 16:58:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:58:00,480 INFO L225 Difference]: With dead ends: 11165 [2021-06-12 16:58:00,481 INFO L226 Difference]: Without dead ends: 5279 [2021-06-12 16:58:00,481 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 127.1ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-12 16:58:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2021-06-12 16:58:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 5279. [2021-06-12 16:58:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5279 states, 5278 states have (on average 3.6290261462675257) internal successors, (19154), 5278 states have internal predecessors, (19154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 19154 transitions. [2021-06-12 16:58:00,596 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 19154 transitions. Word has length 96 [2021-06-12 16:58:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:58:00,597 INFO L482 AbstractCegarLoop]: Abstraction has 5279 states and 19154 transitions. [2021-06-12 16:58:00,597 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 19154 transitions. [2021-06-12 16:58:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-12 16:58:00,607 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:58:00,607 INFO L472 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] [2021-06-12 16:58:00,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 16:58:00,607 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:58:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:58:00,607 INFO L82 PathProgramCache]: Analyzing trace with hash 889805251, now seen corresponding path program 1 times [2021-06-12 16:58:00,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:58:00,608 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728750185] [2021-06-12 16:58:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:58:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:58:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:58:00,720 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:58:00,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728750185] [2021-06-12 16:58:00,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728750185] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:58:00,721 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:58:00,721 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:58:00,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392921081] [2021-06-12 16:58:00,721 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:58:00,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:58:00,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:58:00,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:58:00,722 INFO L87 Difference]: Start difference. First operand 5279 states and 19154 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:58:00,828 INFO L93 Difference]: Finished difference Result 7457 states and 27170 transitions. [2021-06-12 16:58:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 16:58:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-06-12 16:58:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:58:00,835 INFO L225 Difference]: With dead ends: 7457 [2021-06-12 16:58:00,835 INFO L226 Difference]: Without dead ends: 2687 [2021-06-12 16:58:00,835 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 83.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:58:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2021-06-12 16:58:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2687. [2021-06-12 16:58:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2686 states have (on average 3.5323901712583767) internal successors, (9488), 2686 states have internal predecessors, (9488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 9488 transitions. [2021-06-12 16:58:01,061 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 9488 transitions. Word has length 100 [2021-06-12 16:58:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:58:01,062 INFO L482 AbstractCegarLoop]: Abstraction has 2687 states and 9488 transitions. [2021-06-12 16:58:01,062 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 9488 transitions. [2021-06-12 16:58:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-12 16:58:01,066 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:58:01,066 INFO L472 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] [2021-06-12 16:58:01,067 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-12 16:58:01,067 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:58:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:58:01,067 INFO L82 PathProgramCache]: Analyzing trace with hash -310261957, now seen corresponding path program 2 times [2021-06-12 16:58:01,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:58:01,068 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951559929] [2021-06-12 16:58:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:58:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 16:58:01,104 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 16:58:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 16:58:01,138 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 16:58:01,194 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 16:58:01,194 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 16:58:01,195 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-12 16:58:01,196 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-12 16:58:01,198 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 16:58:01,198 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:58:01,199 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:58:01,199 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:58:01,199 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:58:01,199 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:58:01,199 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:58:01,199 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:58:01,199 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P3Thread1of1ForFork2======== [2021-06-12 16:58:01,203 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow [2021-06-12 16:58:25,139 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 128229 states, 128225 states have (on average 4.505681419379996) internal successors, (577741), 128228 states have internal predecessors, (577741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 128229 states, 128225 states have (on average 4.505681419379996) internal successors, (577741), 128228 states have internal predecessors, (577741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-12 16:58:25,345 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:58:25,346 INFO L472 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] [2021-06-12 16:58:25,346 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:58:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:58:25,346 INFO L82 PathProgramCache]: Analyzing trace with hash -484194781, now seen corresponding path program 1 times [2021-06-12 16:58:25,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:58:25,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423119936] [2021-06-12 16:58:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:58:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:58:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:58:25,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:58:25,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423119936] [2021-06-12 16:58:25,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423119936] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:58:25,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:58:25,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 16:58:25,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082204466] [2021-06-12 16:58:25,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 16:58:25,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:58:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 16:58:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:58:25,552 INFO L87 Difference]: Start difference. First operand has 128229 states, 128225 states have (on average 4.505681419379996) internal successors, (577741), 128228 states have internal predecessors, (577741), 0 states have call successors, (0), 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 34.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:58:26,982 INFO L93 Difference]: Finished difference Result 112941 states and 499740 transitions. [2021-06-12 16:58:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 16:58:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-12 16:58:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:58:26,985 INFO L225 Difference]: With dead ends: 112941 [2021-06-12 16:58:26,985 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 16:58:26,986 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:58:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 16:58:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 16:58:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 16:58:26,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2021-06-12 16:58:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:58:26,986 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 16:58:26,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:58:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 16:58:26,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 16:58:26,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-12 16:58:26,987 INFO L301 ceAbstractionStarter]: Result for error location P3Thread1of1ForFork2 was SAFE (3/3) [2021-06-12 16:58:26,987 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 16:58:27,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 04:58:27 BasicIcfg [2021-06-12 16:58:27,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 16:58:27,253 INFO L168 Benchmark]: Toolchain (without parser) took 139174.64 ms. Allocated memory was 198.2 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 162.3 MB in the beginning and 4.1 GB in the end (delta: -3.9 GB). Peak memory consumption was 3.8 GB. Max. memory is 8.0 GB. [2021-06-12 16:58:27,253 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 198.2 MB. Free memory is still 180.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 16:58:27,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.66 ms. Allocated memory is still 198.2 MB. Free memory was 162.1 MB in the beginning and 157.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-12 16:58:27,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.21 ms. Allocated memory is still 198.2 MB. Free memory was 157.4 MB in the beginning and 153.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-12 16:58:27,253 INFO L168 Benchmark]: Boogie Preprocessor took 32.18 ms. Allocated memory is still 198.2 MB. Free memory was 153.8 MB in the beginning and 151.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 16:58:27,253 INFO L168 Benchmark]: RCFGBuilder took 1680.78 ms. Allocated memory was 198.2 MB in the beginning and 238.0 MB in the end (delta: 39.8 MB). Free memory was 151.7 MB in the beginning and 197.8 MB in the end (delta: -46.1 MB). Peak memory consumption was 92.4 MB. Max. memory is 8.0 GB. [2021-06-12 16:58:27,254 INFO L168 Benchmark]: TraceAbstraction took 136891.55 ms. Allocated memory was 238.0 MB in the beginning and 8.0 GB in the end (delta: 7.7 GB). Free memory was 197.2 MB in the beginning and 4.1 GB in the end (delta: -3.9 GB). Peak memory consumption was 3.8 GB. Max. memory is 8.0 GB. [2021-06-12 16:58:27,254 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.14 ms. Allocated memory is still 198.2 MB. Free memory is still 180.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 516.66 ms. Allocated memory is still 198.2 MB. Free memory was 162.1 MB in the beginning and 157.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 45.21 ms. Allocated memory is still 198.2 MB. Free memory was 157.4 MB in the beginning and 153.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.18 ms. Allocated memory is still 198.2 MB. Free memory was 153.8 MB in the beginning and 151.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1680.78 ms. Allocated memory was 198.2 MB in the beginning and 238.0 MB in the end (delta: 39.8 MB). Free memory was 151.7 MB in the beginning and 197.8 MB in the end (delta: -46.1 MB). Peak memory consumption was 92.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 136891.55 ms. Allocated memory was 238.0 MB in the beginning and 8.0 GB in the end (delta: 7.7 GB). Free memory was 197.2 MB in the beginning and 4.1 GB in the end (delta: -3.9 GB). Peak memory consumption was 3.8 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_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}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L846] 0 pthread_t t1245; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L847] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, 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 t1246; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, 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 t1247; VAL [__unbuffered_cnt=0, __unbuffered_p0_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, 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(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, 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 t1248; VAL [__unbuffered_cnt=0, __unbuffered_p0_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, 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(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, 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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, 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] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, 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] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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] [L767] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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] [L770] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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] [L782] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p0_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=2, 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] [L785] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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=2, 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] [L788] 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) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] 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) [L788] 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) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 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 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 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 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_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=2, 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] [L824] 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) [L824] 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) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 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 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 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 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=2, 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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_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=2, 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] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_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, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p0_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, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] 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) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] 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) [L859] 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) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 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 [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 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) [L870] 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) [L871] 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)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L871] 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)) [L871] 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)) [L872] 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)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L872] 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)) [L872] 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)) [L873] 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)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L873] 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)) [L873] 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)) [L874] 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)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] 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)) [L874] 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)) [L875] 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)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L875] 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)) [L875] 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)) [L876] 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)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_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, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p0_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, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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 [__unbuffered_cnt=4, __unbuffered_p0_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, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P3 with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28966.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 1182.6ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27780.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=128229occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 81741.3ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 2010.6ms, AutomataDifference: 20480.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 25362.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3413 SDtfs, 5810 SDslu, 16027 SDs, 0 SdLazy, 1632 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1767.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 4285.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=128229occurred in iteration=0, InterpolantAutomatonStates: 217, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 28331.1ms AutomataMinimizationTime, 18 MinimizatonAttempts, 42318 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 69.0ms SsaConstructionTime, 785.3ms SatisfiabilityAnalysisTime, 4067.0ms InterpolantComputationTime, 1702 NumberOfCodeBlocks, 1702 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 9503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P3Thread1of1ForFork2 with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25788.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 206.7ms, AutomataDifference: 1613.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23939.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 117 SDtfs, 43 SDslu, 82 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=128229occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5ms SsaConstructionTime, 4.2ms SatisfiabilityAnalysisTime, 16.1ms InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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! Received shutdown request...