/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/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 16:20:01,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 16:20:01,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 16:20:01,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 16:20:01,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 16:20:01,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 16:20:01,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 16:20:01,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 16:20:01,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 16:20:01,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 16:20:01,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 16:20:01,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 16:20:01,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 16:20:01,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 16:20:01,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 16:20:01,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 16:20:01,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 16:20:01,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 16:20:01,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 16:20:01,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 16:20:01,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 16:20:01,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 16:20:01,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 16:20:01,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 16:20:01,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 16:20:01,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 16:20:01,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 16:20:01,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 16:20:01,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 16:20:01,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 16:20:01,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 16:20:01,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 16:20:01,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 16:20:01,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 16:20:01,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 16:20:01,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 16:20:01,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 16:20:01,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 16:20:01,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 16:20:01,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 16:20:01,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 16:20:01,796 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:20:01,843 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 16:20:01,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 16:20:01,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 16:20:01,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 16:20:01,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 16:20:01,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 16:20:01,845 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 16:20:01,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 16:20:01,845 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 16:20:01,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 16:20:01,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 16:20:01,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 16:20:01,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 16:20:01,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 16:20:01,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 16:20:01,846 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 16:20:01,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 16:20:01,847 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 16:20:01,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 16:20:01,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 16:20:01,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 16:20:01,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 16:20:01,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 16:20:01,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 16:20:01,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 16:20:01,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 16:20:01,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 16:20:01,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 16:20:01,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 16:20:01,848 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 16:20:01,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 16:20:01,849 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:20:02,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 16:20:02,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 16:20:02,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 16:20:02,198 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 16:20:02,200 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 16:20:02,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2021-06-12 16:20:02,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f9d7f52/ae99c4bdd8b049ffa11d8c3a934da849/FLAG61f9e2327 [2021-06-12 16:20:02,829 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 16:20:02,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2021-06-12 16:20:02,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f9d7f52/ae99c4bdd8b049ffa11d8c3a934da849/FLAG61f9e2327 [2021-06-12 16:20:03,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f9d7f52/ae99c4bdd8b049ffa11d8c3a934da849 [2021-06-12 16:20:03,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 16:20:03,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 16:20:03,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 16:20:03,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 16:20:03,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 16:20:03,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 04:20:03" (1/1) ... [2021-06-12 16:20:03,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53eccf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03, skipping insertion in model container [2021-06-12 16:20:03,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 04:20:03" (1/1) ... [2021-06-12 16:20:03,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 16:20:03,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 16:20:03,441 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/mix021_tso.oepc.i[949,962] [2021-06-12 16:20:03,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 16:20:03,721 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 16:20:03,732 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/mix021_tso.oepc.i[949,962] [2021-06-12 16:20:03,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 16:20:03,860 INFO L208 MainTranslator]: Completed translation [2021-06-12 16:20:03,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03 WrapperNode [2021-06-12 16:20:03,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 16:20:03,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 16:20:03,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 16:20:03,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 16:20:03,866 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:20:03" (1/1) ... [2021-06-12 16:20:03,902 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:20:03" (1/1) ... [2021-06-12 16:20:03,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 16:20:03,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 16:20:03,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 16:20:03,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 16:20:03,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03" (1/1) ... [2021-06-12 16:20:03,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03" (1/1) ... [2021-06-12 16:20:03,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03" (1/1) ... [2021-06-12 16:20:03,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03" (1/1) ... [2021-06-12 16:20:03,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03" (1/1) ... [2021-06-12 16:20:03,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03" (1/1) ... [2021-06-12 16:20:03,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03" (1/1) ... [2021-06-12 16:20:03,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 16:20:03,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 16:20:03,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 16:20:03,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 16:20:03,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03" (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:20:04,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 16:20:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-12 16:20:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 16:20:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 16:20:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-12 16:20:04,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-12 16:20:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-12 16:20:04,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-12 16:20:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-12 16:20:04,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-12 16:20:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-12 16:20:04,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-12 16:20:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 16:20:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-12 16:20:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 16:20:04,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 16:20:04,041 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:20:05,901 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 16:20:05,902 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-12 16:20:05,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 04:20:05 BoogieIcfgContainer [2021-06-12 16:20:05,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 16:20:05,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 16:20:05,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 16:20:05,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 16:20:05,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 04:20:03" (1/3) ... [2021-06-12 16:20:05,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4152d3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 04:20:05, skipping insertion in model container [2021-06-12 16:20:05,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:20:03" (2/3) ... [2021-06-12 16:20:05,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4152d3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 04:20:05, skipping insertion in model container [2021-06-12 16:20:05,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 04:20:05" (3/3) ... [2021-06-12 16:20:05,910 INFO L111 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2021-06-12 16:20:05,915 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 16:20:05,916 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 16:20:05,916 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-12 16:20:05,917 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 16:20:05,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,947 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,948 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,948 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,948 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,949 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,949 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,950 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,950 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,953 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,954 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,954 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,954 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,954 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,954 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,955 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,955 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,958 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,958 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,958 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,958 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,966 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,966 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:20:05,972 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-12 16:20:05,990 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 16:20:06,006 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:20:06,006 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:20:06,006 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:20:06,006 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:20:06,006 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:20:06,006 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:20:06,007 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:20:06,007 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2======== [2021-06-12 16:20:06,016 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow [2021-06-12 16:20:37,180 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 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:20:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 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:20:38,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 16:20:38,820 INFO L301 ceAbstractionStarter]: Result for error location P2 was SAFE (1/3) [2021-06-12 16:20:38,822 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 16:20:38,835 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:20:38,835 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:20:38,835 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:20:38,835 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:20:38,835 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:20:38,835 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:20:38,835 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:20:38,835 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork2======== [2021-06-12 16:20:38,838 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow [2021-06-12 16:21:07,478 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 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:21:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 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:21:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-12 16:21:07,779 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:21:07,781 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] [2021-06-12 16:21:07,782 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:21:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:21:07,786 INFO L82 PathProgramCache]: Analyzing trace with hash -803804790, now seen corresponding path program 1 times [2021-06-12 16:21:07,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:21:07,792 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468701526] [2021-06-12 16:21:07,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:21:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:21:08,073 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:21:08,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:21:08,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468701526] [2021-06-12 16:21:08,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468701526] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:21:08,075 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:21:08,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 16:21:08,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552618842] [2021-06-12 16:21:08,079 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 16:21:08,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:21:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 16:21:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:21:08,293 INFO L87 Difference]: Start difference. First operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 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 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:21:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:21:10,299 INFO L93 Difference]: Finished difference Result 116517 states and 516070 transitions. [2021-06-12 16:21:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 16:21:10,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-06-12 16:21:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:21:10,306 INFO L225 Difference]: With dead ends: 116517 [2021-06-12 16:21:10,306 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 16:21:10,307 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:21:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 16:21:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 16:21:10,324 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:21:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 16:21:10,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2021-06-12 16:21:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:21:10,325 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 16:21:10,326 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:21:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 16:21:10,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 16:21:10,326 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 16:21:10,326 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork2 was SAFE (2/3) [2021-06-12 16:21:10,327 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-12 16:21:10,328 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:21:10,328 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:21:10,328 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:21:10,328 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:21:10,328 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:21:10,328 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:21:10,328 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:21:10,328 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 16:21:10,331 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow [2021-06-12 16:21:37,997 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 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:21:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 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:21:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-12 16:21:38,219 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:21:38,219 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] [2021-06-12 16:21:38,219 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:21:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:21:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2144397672, now seen corresponding path program 1 times [2021-06-12 16:21:38,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:21:38,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093541371] [2021-06-12 16:21:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:21:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:21:38,793 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:21:38,793 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:21:38,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093541371] [2021-06-12 16:21:38,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093541371] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:21:38,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:21:38,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:21:38,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363253155] [2021-06-12 16:21:38,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:21:38,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:21:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:21:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:21:38,968 INFO L87 Difference]: Start difference. First operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 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.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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:21:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:21:41,334 INFO L93 Difference]: Finished difference Result 194849 states and 863707 transitions. [2021-06-12 16:21:41,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:21:41,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2021-06-12 16:21:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:21:42,552 INFO L225 Difference]: With dead ends: 194849 [2021-06-12 16:21:42,552 INFO L226 Difference]: Without dead ends: 69137 [2021-06-12 16:21:42,569 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 131.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:21:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69137 states. [2021-06-12 16:21:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69137 to 69137. [2021-06-12 16:21:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69137 states, 69135 states have (on average 4.373587907716786) internal successors, (302368), 69136 states have internal predecessors, (302368), 0 states have call successors, (0), 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:21:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69137 states to 69137 states and 302368 transitions. [2021-06-12 16:21:47,231 INFO L78 Accepts]: Start accepts. Automaton has 69137 states and 302368 transitions. Word has length 79 [2021-06-12 16:21:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:21:47,232 INFO L482 AbstractCegarLoop]: Abstraction has 69137 states and 302368 transitions. [2021-06-12 16:21:47,232 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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:21:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 69137 states and 302368 transitions. [2021-06-12 16:21:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-12 16:21:47,330 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:21:47,331 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] [2021-06-12 16:21:47,331 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 16:21:47,331 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:21:47,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:21:47,332 INFO L82 PathProgramCache]: Analyzing trace with hash 779588023, now seen corresponding path program 1 times [2021-06-12 16:21:47,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:21:47,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405525253] [2021-06-12 16:21:47,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:21:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:21:47,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:21:47,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:21:47,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405525253] [2021-06-12 16:21:47,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405525253] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:21:47,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:21:47,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:21:47,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937976193] [2021-06-12 16:21:47,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:21:47,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:21:47,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:21:47,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:21:47,532 INFO L87 Difference]: Start difference. First operand 69137 states and 302368 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:21:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:21:48,599 INFO L93 Difference]: Finished difference Result 77237 states and 335038 transitions. [2021-06-12 16:21:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:21:48,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-12 16:21:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:21:49,044 INFO L225 Difference]: With dead ends: 77237 [2021-06-12 16:21:49,044 INFO L226 Difference]: Without dead ends: 61037 [2021-06-12 16:21:49,045 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 94.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:21:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61037 states. [2021-06-12 16:21:51,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61037 to 61037. [2021-06-12 16:21:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61037 states, 61035 states have (on average 4.345015155238797) internal successors, (265198), 61036 states have internal predecessors, (265198), 0 states have call successors, (0), 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:21:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61037 states to 61037 states and 265198 transitions. [2021-06-12 16:21:51,594 INFO L78 Accepts]: Start accepts. Automaton has 61037 states and 265198 transitions. Word has length 81 [2021-06-12 16:21:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:21:51,595 INFO L482 AbstractCegarLoop]: Abstraction has 61037 states and 265198 transitions. [2021-06-12 16:21:51,595 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:21:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 61037 states and 265198 transitions. [2021-06-12 16:21:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-12 16:21:51,686 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:21:51,686 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:21:51,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 16:21:51,686 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:21:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:21:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1310213575, now seen corresponding path program 1 times [2021-06-12 16:21:51,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:21:51,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875371484] [2021-06-12 16:21:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:21:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:21:52,001 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:21:52,001 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:21:52,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875371484] [2021-06-12 16:21:52,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875371484] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:21:52,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:21:52,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-12 16:21:52,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478181179] [2021-06-12 16:21:52,002 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-12 16:21:52,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:21:52,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-12 16:21:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:21:52,002 INFO L87 Difference]: Start difference. First operand 61037 states and 265198 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:21:52,578 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-06-12 16:21:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:21:52,923 INFO L93 Difference]: Finished difference Result 69641 states and 300217 transitions. [2021-06-12 16:21:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 16:21:52,924 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:21:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:21:53,408 INFO L225 Difference]: With dead ends: 69641 [2021-06-12 16:21:53,409 INFO L226 Difference]: Without dead ends: 58721 [2021-06-12 16:21:53,409 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 451.3ms TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2021-06-12 16:21:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58721 states. [2021-06-12 16:21:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58721 to 58721. [2021-06-12 16:21:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58721 states, 58719 states have (on average 4.330983157070113) internal successors, (254311), 58720 states have internal predecessors, (254311), 0 states have call successors, (0), 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:21:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58721 states to 58721 states and 254311 transitions. [2021-06-12 16:21:55,644 INFO L78 Accepts]: Start accepts. Automaton has 58721 states and 254311 transitions. Word has length 84 [2021-06-12 16:21:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:21:55,644 INFO L482 AbstractCegarLoop]: Abstraction has 58721 states and 254311 transitions. [2021-06-12 16:21:55,645 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:21:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 58721 states and 254311 transitions. [2021-06-12 16:21:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-12 16:21:55,750 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:21:55,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] [2021-06-12 16:21:55,750 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 16:21:55,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:21:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:21:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1462804639, now seen corresponding path program 1 times [2021-06-12 16:21:55,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:21:55,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670965004] [2021-06-12 16:21:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:21:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:21:55,946 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:21:55,947 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:21:55,947 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670965004] [2021-06-12 16:21:55,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670965004] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:21:55,947 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:21:55,947 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 16:21:55,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958337934] [2021-06-12 16:21:55,948 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 16:21:55,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:21:55,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 16:21:55,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-12 16:21:55,949 INFO L87 Difference]: Start difference. First operand 58721 states and 254311 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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:21:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:21:57,132 INFO L93 Difference]: Finished difference Result 72161 states and 311240 transitions. [2021-06-12 16:21:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 16:21:57,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-06-12 16:21:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:21:57,382 INFO L225 Difference]: With dead ends: 72161 [2021-06-12 16:21:57,382 INFO L226 Difference]: Without dead ends: 63369 [2021-06-12 16:21:57,382 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 334.5ms TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2021-06-12 16:21:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63369 states. [2021-06-12 16:21:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63369 to 62025. [2021-06-12 16:21:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62025 states, 62023 states have (on average 4.330458055882495) internal successors, (268588), 62024 states have internal predecessors, (268588), 0 states have call successors, (0), 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:21:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62025 states to 62025 states and 268588 transitions. [2021-06-12 16:21:59,772 INFO L78 Accepts]: Start accepts. Automaton has 62025 states and 268588 transitions. Word has length 85 [2021-06-12 16:21:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:21:59,772 INFO L482 AbstractCegarLoop]: Abstraction has 62025 states and 268588 transitions. [2021-06-12 16:21:59,772 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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:21:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 62025 states and 268588 transitions. [2021-06-12 16:22:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-12 16:22:00,224 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:00,225 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:22:00,225 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 16:22:00,225 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:22:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1622435688, now seen corresponding path program 1 times [2021-06-12 16:22:00,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:00,226 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453482817] [2021-06-12 16:22:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:00,514 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:22:00,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:00,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453482817] [2021-06-12 16:22:00,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453482817] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:00,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:00,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:22:00,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5670237] [2021-06-12 16:22:00,516 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:22:00,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:00,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:22:00,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:22:00,517 INFO L87 Difference]: Start difference. First operand 62025 states and 268588 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 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:22:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:01,859 INFO L93 Difference]: Finished difference Result 92937 states and 396024 transitions. [2021-06-12 16:22:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 16:22:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 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:22:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:02,452 INFO L225 Difference]: With dead ends: 92937 [2021-06-12 16:22:02,452 INFO L226 Difference]: Without dead ends: 75661 [2021-06-12 16:22:02,452 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 464.0ms TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2021-06-12 16:22:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75661 states. [2021-06-12 16:22:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75661 to 68941. [2021-06-12 16:22:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68941 states, 68939 states have (on average 4.287544060691336) internal successors, (295579), 68940 states have internal predecessors, (295579), 0 states have call successors, (0), 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:22:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68941 states to 68941 states and 295579 transitions. [2021-06-12 16:22:05,117 INFO L78 Accepts]: Start accepts. Automaton has 68941 states and 295579 transitions. Word has length 86 [2021-06-12 16:22:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:05,117 INFO L482 AbstractCegarLoop]: Abstraction has 68941 states and 295579 transitions. [2021-06-12 16:22:05,117 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 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:22:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 68941 states and 295579 transitions. [2021-06-12 16:22:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-12 16:22:05,285 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:05,285 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:22:05,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 16:22:05,285 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:22:05,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:05,302 INFO L82 PathProgramCache]: Analyzing trace with hash -670887584, now seen corresponding path program 1 times [2021-06-12 16:22:05,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:05,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66581896] [2021-06-12 16:22:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:05,627 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:22:05,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:05,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66581896] [2021-06-12 16:22:05,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66581896] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:05,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:05,627 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 16:22:05,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354993097] [2021-06-12 16:22:05,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 16:22:05,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 16:22:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-12 16:22:05,629 INFO L87 Difference]: Start difference. First operand 68941 states and 295579 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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:22:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:06,795 INFO L93 Difference]: Finished difference Result 69165 states and 294980 transitions. [2021-06-12 16:22:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 16:22:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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:22:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:07,182 INFO L225 Difference]: With dead ends: 69165 [2021-06-12 16:22:07,182 INFO L226 Difference]: Without dead ends: 64685 [2021-06-12 16:22:07,183 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 325.6ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-06-12 16:22:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64685 states. [2021-06-12 16:22:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64685 to 64685. [2021-06-12 16:22:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64685 states, 64684 states have (on average 4.2801929379753885) internal successors, (276860), 64684 states have internal predecessors, (276860), 0 states have call successors, (0), 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:22:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64685 states to 64685 states and 276860 transitions. [2021-06-12 16:22:09,996 INFO L78 Accepts]: Start accepts. Automaton has 64685 states and 276860 transitions. Word has length 87 [2021-06-12 16:22:09,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:09,996 INFO L482 AbstractCegarLoop]: Abstraction has 64685 states and 276860 transitions. [2021-06-12 16:22:09,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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:22:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 64685 states and 276860 transitions. [2021-06-12 16:22:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:22:10,127 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:10,127 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:22:10,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 16:22:10,127 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:22:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:10,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1884272151, now seen corresponding path program 1 times [2021-06-12 16:22:10,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:10,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84078691] [2021-06-12 16:22:10,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:10,582 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:22:10,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:10,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84078691] [2021-06-12 16:22:10,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84078691] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:10,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:10,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-12 16:22:10,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106981095] [2021-06-12 16:22:10,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-12 16:22:10,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:10,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-12 16:22:10,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-12 16:22:10,584 INFO L87 Difference]: Start difference. First operand 64685 states and 276860 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 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:22:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:11,873 INFO L93 Difference]: Finished difference Result 77285 states and 330206 transitions. [2021-06-12 16:22:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-12 16:22:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 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:22:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:12,408 INFO L225 Difference]: With dead ends: 77285 [2021-06-12 16:22:12,409 INFO L226 Difference]: Without dead ends: 72133 [2021-06-12 16:22:12,409 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 384.2ms TimeCoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2021-06-12 16:22:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72133 states. [2021-06-12 16:22:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72133 to 61829. [2021-06-12 16:22:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61829 states, 61828 states have (on average 4.281393543378405) internal successors, (264710), 61828 states have internal predecessors, (264710), 0 states have call successors, (0), 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:22:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61829 states to 61829 states and 264710 transitions. [2021-06-12 16:22:14,289 INFO L78 Accepts]: Start accepts. Automaton has 61829 states and 264710 transitions. Word has length 88 [2021-06-12 16:22:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:14,289 INFO L482 AbstractCegarLoop]: Abstraction has 61829 states and 264710 transitions. [2021-06-12 16:22:14,289 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 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:22:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 61829 states and 264710 transitions. [2021-06-12 16:22:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:22:14,760 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:14,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:22:14,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 16:22:14,760 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:22:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash -78023138, now seen corresponding path program 1 times [2021-06-12 16:22:14,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:14,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968860871] [2021-06-12 16:22:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:15,014 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:22:15,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:15,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968860871] [2021-06-12 16:22:15,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968860871] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:15,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:15,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:22:15,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327289222] [2021-06-12 16:22:15,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:22:15,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:15,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:22:15,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:22:15,016 INFO L87 Difference]: Start difference. First operand 61829 states and 264710 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:22:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:15,972 INFO L93 Difference]: Finished difference Result 65909 states and 280914 transitions. [2021-06-12 16:22:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 16:22:15,973 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:22:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:16,206 INFO L225 Difference]: With dead ends: 65909 [2021-06-12 16:22:16,206 INFO L226 Difference]: Without dead ends: 61109 [2021-06-12 16:22:16,206 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 313.1ms TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-06-12 16:22:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61109 states. [2021-06-12 16:22:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61109 to 59597. [2021-06-12 16:22:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59597 states, 59596 states have (on average 4.272702865964159) internal successors, (254636), 59596 states have internal predecessors, (254636), 0 states have call successors, (0), 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:22:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59597 states to 59597 states and 254636 transitions. [2021-06-12 16:22:18,325 INFO L78 Accepts]: Start accepts. Automaton has 59597 states and 254636 transitions. Word has length 88 [2021-06-12 16:22:18,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:18,325 INFO L482 AbstractCegarLoop]: Abstraction has 59597 states and 254636 transitions. [2021-06-12 16:22:18,325 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:22:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 59597 states and 254636 transitions. [2021-06-12 16:22:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:22:18,488 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:18,488 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:22:18,488 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 16:22:18,488 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:22:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash -457859718, now seen corresponding path program 1 times [2021-06-12 16:22:18,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:18,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004241839] [2021-06-12 16:22:18,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:18,580 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:22:18,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:18,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004241839] [2021-06-12 16:22:18,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004241839] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:18,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:18,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:22:18,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560999828] [2021-06-12 16:22:18,581 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:22:18,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:22:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:22:18,583 INFO L87 Difference]: Start difference. First operand 59597 states and 254636 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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:22:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:19,440 INFO L93 Difference]: Finished difference Result 91837 states and 390745 transitions. [2021-06-12 16:22:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 16:22:19,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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:22:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:19,648 INFO L225 Difference]: With dead ends: 91837 [2021-06-12 16:22:19,648 INFO L226 Difference]: Without dead ends: 57497 [2021-06-12 16:22:19,648 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:22:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57497 states. [2021-06-12 16:22:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57497 to 53297. [2021-06-12 16:22:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53297 states, 53296 states have (on average 4.174196937856499) internal successors, (222468), 53296 states have internal predecessors, (222468), 0 states have call successors, (0), 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:22:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53297 states to 53297 states and 222468 transitions. [2021-06-12 16:22:21,321 INFO L78 Accepts]: Start accepts. Automaton has 53297 states and 222468 transitions. Word has length 88 [2021-06-12 16:22:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:21,322 INFO L482 AbstractCegarLoop]: Abstraction has 53297 states and 222468 transitions. [2021-06-12 16:22:21,322 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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:22:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 53297 states and 222468 transitions. [2021-06-12 16:22:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-12 16:22:21,398 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:21,398 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:22:21,398 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 16:22:21,399 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:22:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1412266404, now seen corresponding path program 2 times [2021-06-12 16:22:21,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:21,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694446344] [2021-06-12 16:22:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:21,832 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:22:21,832 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:21,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694446344] [2021-06-12 16:22:21,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694446344] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:21,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:21,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:22:21,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182751354] [2021-06-12 16:22:21,833 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:22:21,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:21,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:22:21,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:22:21,837 INFO L87 Difference]: Start difference. First operand 53297 states and 222468 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:22:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:22,567 INFO L93 Difference]: Finished difference Result 66997 states and 276236 transitions. [2021-06-12 16:22:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:22:22,568 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:22:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:22,832 INFO L225 Difference]: With dead ends: 66997 [2021-06-12 16:22:22,834 INFO L226 Difference]: Without dead ends: 49301 [2021-06-12 16:22:22,834 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 83.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:22:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49301 states. [2021-06-12 16:22:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49301 to 49301. [2021-06-12 16:22:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49301 states, 49300 states have (on average 4.122839756592292) internal successors, (203256), 49300 states have internal predecessors, (203256), 0 states have call successors, (0), 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:22:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49301 states to 49301 states and 203256 transitions. [2021-06-12 16:22:24,787 INFO L78 Accepts]: Start accepts. Automaton has 49301 states and 203256 transitions. Word has length 88 [2021-06-12 16:22:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:24,788 INFO L482 AbstractCegarLoop]: Abstraction has 49301 states and 203256 transitions. [2021-06-12 16:22:24,804 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:22:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 49301 states and 203256 transitions. [2021-06-12 16:22:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-12 16:22:24,905 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:24,905 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:22:24,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 16:22:24,905 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:22:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1381665346, now seen corresponding path program 1 times [2021-06-12 16:22:24,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:24,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427640230] [2021-06-12 16:22:24,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:25,069 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:22:25,069 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:25,070 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427640230] [2021-06-12 16:22:25,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427640230] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:25,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:25,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:22:25,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764814731] [2021-06-12 16:22:25,070 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:22:25,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:25,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:22:25,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:22:25,071 INFO L87 Difference]: Start difference. First operand 49301 states and 203256 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:22:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:25,740 INFO L93 Difference]: Finished difference Result 53279 states and 214980 transitions. [2021-06-12 16:22:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 16:22:25,740 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:22:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:25,866 INFO L225 Difference]: With dead ends: 53279 [2021-06-12 16:22:25,866 INFO L226 Difference]: Without dead ends: 38015 [2021-06-12 16:22:25,867 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 109.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:22:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38015 states. [2021-06-12 16:22:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38015 to 38015. [2021-06-12 16:22:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38015 states, 38014 states have (on average 4.001157468301153) internal successors, (152100), 38014 states have internal predecessors, (152100), 0 states have call successors, (0), 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:22:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38015 states to 38015 states and 152100 transitions. [2021-06-12 16:22:26,829 INFO L78 Accepts]: Start accepts. Automaton has 38015 states and 152100 transitions. Word has length 89 [2021-06-12 16:22:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:26,830 INFO L482 AbstractCegarLoop]: Abstraction has 38015 states and 152100 transitions. [2021-06-12 16:22:26,830 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:22:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 38015 states and 152100 transitions. [2021-06-12 16:22:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-12 16:22:26,890 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:26,890 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:22:26,890 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 16:22:26,890 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:22:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:26,891 INFO L82 PathProgramCache]: Analyzing trace with hash -489786787, now seen corresponding path program 1 times [2021-06-12 16:22:26,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:26,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737803529] [2021-06-12 16:22:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:27,225 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-06-12 16:22:27,288 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:22:27,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:27,289 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737803529] [2021-06-12 16:22:27,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737803529] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:27,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:27,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:22:27,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300954388] [2021-06-12 16:22:27,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:22:27,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:27,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:22:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:22:27,290 INFO L87 Difference]: Start difference. First operand 38015 states and 152100 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:22:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:27,718 INFO L93 Difference]: Finished difference Result 61333 states and 242908 transitions. [2021-06-12 16:22:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:22:27,718 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:22:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:27,816 INFO L225 Difference]: With dead ends: 61333 [2021-06-12 16:22:27,816 INFO L226 Difference]: Without dead ends: 39743 [2021-06-12 16:22:27,817 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 92.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:22:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39743 states. [2021-06-12 16:22:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39743 to 37115. [2021-06-12 16:22:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37115 states, 37114 states have (on average 3.9113272619496686) internal successors, (145165), 37114 states have internal predecessors, (145165), 0 states have call successors, (0), 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:22:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37115 states to 37115 states and 145165 transitions. [2021-06-12 16:22:29,128 INFO L78 Accepts]: Start accepts. Automaton has 37115 states and 145165 transitions. Word has length 91 [2021-06-12 16:22:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:29,128 INFO L482 AbstractCegarLoop]: Abstraction has 37115 states and 145165 transitions. [2021-06-12 16:22:29,128 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:22:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 37115 states and 145165 transitions. [2021-06-12 16:22:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-12 16:22:29,186 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:29,186 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:22:29,186 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 16:22:29,186 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:22:29,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:29,186 INFO L82 PathProgramCache]: Analyzing trace with hash 822207307, now seen corresponding path program 1 times [2021-06-12 16:22:29,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:29,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013016296] [2021-06-12 16:22:29,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:29,424 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:22:29,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:29,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013016296] [2021-06-12 16:22:29,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013016296] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:29,425 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:29,425 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-12 16:22:29,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596143299] [2021-06-12 16:22:29,425 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-12 16:22:29,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:29,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-12 16:22:29,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-06-12 16:22:29,426 INFO L87 Difference]: Start difference. First operand 37115 states and 145165 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 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:22:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:30,252 INFO L93 Difference]: Finished difference Result 43275 states and 168370 transitions. [2021-06-12 16:22:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 16:22:30,252 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 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:22:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:30,406 INFO L225 Difference]: With dead ends: 43275 [2021-06-12 16:22:30,406 INFO L226 Difference]: Without dead ends: 38346 [2021-06-12 16:22:30,406 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 291.1ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-06-12 16:22:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38346 states. [2021-06-12 16:22:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38346 to 37386. [2021-06-12 16:22:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37386 states, 37385 states have (on average 3.9057108465962282) internal successors, (146015), 37385 states have internal predecessors, (146015), 0 states have call successors, (0), 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:22:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37386 states to 37386 states and 146015 transitions. [2021-06-12 16:22:31,353 INFO L78 Accepts]: Start accepts. Automaton has 37386 states and 146015 transitions. Word has length 92 [2021-06-12 16:22:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:31,354 INFO L482 AbstractCegarLoop]: Abstraction has 37386 states and 146015 transitions. [2021-06-12 16:22:31,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 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:22:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 37386 states and 146015 transitions. [2021-06-12 16:22:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-12 16:22:31,413 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:31,413 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:22:31,416 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 16:22:31,417 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:22:31,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash 460924311, now seen corresponding path program 1 times [2021-06-12 16:22:31,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:31,418 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891491662] [2021-06-12 16:22:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:31,519 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:22:31,519 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:31,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891491662] [2021-06-12 16:22:31,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891491662] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:31,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:31,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 16:22:31,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715970017] [2021-06-12 16:22:31,522 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 16:22:31,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:31,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 16:22:31,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-12 16:22:31,522 INFO L87 Difference]: Start difference. First operand 37386 states and 146015 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:22:31,936 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-06-12 16:22:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:32,165 INFO L93 Difference]: Finished difference Result 34182 states and 130664 transitions. [2021-06-12 16:22:32,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 16:22:32,166 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:22:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:32,245 INFO L225 Difference]: With dead ends: 34182 [2021-06-12 16:22:32,246 INFO L226 Difference]: Without dead ends: 24642 [2021-06-12 16:22:32,246 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 393.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-12 16:22:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24642 states. [2021-06-12 16:22:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24642 to 22617. [2021-06-12 16:22:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22617 states, 22616 states have (on average 3.7865670321896) internal successors, (85637), 22616 states have internal predecessors, (85637), 0 states have call successors, (0), 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:22:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22617 states to 22617 states and 85637 transitions. [2021-06-12 16:22:33,137 INFO L78 Accepts]: Start accepts. Automaton has 22617 states and 85637 transitions. Word has length 92 [2021-06-12 16:22:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:33,138 INFO L482 AbstractCegarLoop]: Abstraction has 22617 states and 85637 transitions. [2021-06-12 16:22:33,138 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:22:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22617 states and 85637 transitions. [2021-06-12 16:22:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-12 16:22:33,171 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:33,171 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] [2021-06-12 16:22:33,171 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 16:22:33,171 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:22:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 537631958, now seen corresponding path program 1 times [2021-06-12 16:22:33,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:33,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973642011] [2021-06-12 16:22:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:33,281 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:22:33,281 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:33,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973642011] [2021-06-12 16:22:33,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973642011] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:33,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:33,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-12 16:22:33,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429715854] [2021-06-12 16:22:33,282 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-12 16:22:33,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:33,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-12 16:22:33,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-12 16:22:33,282 INFO L87 Difference]: Start difference. First operand 22617 states and 85637 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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:22:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:33,566 INFO L93 Difference]: Finished difference Result 19539 states and 73298 transitions. [2021-06-12 16:22:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 16:22:33,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-06-12 16:22:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:33,591 INFO L225 Difference]: With dead ends: 19539 [2021-06-12 16:22:33,591 INFO L226 Difference]: Without dead ends: 11109 [2021-06-12 16:22:33,591 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 145.2ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-12 16:22:33,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2021-06-12 16:22:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 8409. [2021-06-12 16:22:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8409 states, 8408 states have (on average 3.681374881065652) internal successors, (30953), 8408 states have internal predecessors, (30953), 0 states have call successors, (0), 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:22:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 30953 transitions. [2021-06-12 16:22:33,754 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 30953 transitions. Word has length 95 [2021-06-12 16:22:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:33,754 INFO L482 AbstractCegarLoop]: Abstraction has 8409 states and 30953 transitions. [2021-06-12 16:22:33,755 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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:22:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 30953 transitions. [2021-06-12 16:22:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-12 16:22:33,941 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:33,941 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] [2021-06-12 16:22:33,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 16:22:33,941 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:22:33,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:33,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1585584236, now seen corresponding path program 1 times [2021-06-12 16:22:33,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:33,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597826293] [2021-06-12 16:22:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:34,062 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:22:34,062 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:34,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597826293] [2021-06-12 16:22:34,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597826293] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:34,063 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:34,063 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:22:34,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073649250] [2021-06-12 16:22:34,063 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:22:34,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:34,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:22:34,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:22:34,064 INFO L87 Difference]: Start difference. First operand 8409 states and 30953 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 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:22:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:34,172 INFO L93 Difference]: Finished difference Result 11097 states and 40884 transitions. [2021-06-12 16:22:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 16:22:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2021-06-12 16:22:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:34,180 INFO L225 Difference]: With dead ends: 11097 [2021-06-12 16:22:34,180 INFO L226 Difference]: Without dead ends: 3580 [2021-06-12 16:22:34,181 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:22:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2021-06-12 16:22:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3580. [2021-06-12 16:22:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3579 states have (on average 3.542889075160659) internal successors, (12680), 3579 states have internal predecessors, (12680), 0 states have call successors, (0), 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:22:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 12680 transitions. [2021-06-12 16:22:34,234 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 12680 transitions. Word has length 99 [2021-06-12 16:22:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:34,234 INFO L482 AbstractCegarLoop]: Abstraction has 3580 states and 12680 transitions. [2021-06-12 16:22:34,235 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 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:22:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 12680 transitions. [2021-06-12 16:22:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-12 16:22:34,240 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:34,240 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] [2021-06-12 16:22:34,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 16:22:34,240 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:22:34,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:34,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1069134434, now seen corresponding path program 2 times [2021-06-12 16:22:34,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:34,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278482676] [2021-06-12 16:22:34,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:22:34,445 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:22:34,445 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:22:34,445 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278482676] [2021-06-12 16:22:34,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278482676] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:22:34,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:22:34,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 16:22:34,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172887090] [2021-06-12 16:22:34,446 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 16:22:34,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:22:34,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 16:22:34,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:22:34,446 INFO L87 Difference]: Start difference. First operand 3580 states and 12680 transitions. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 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:22:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:22:34,652 INFO L93 Difference]: Finished difference Result 5590 states and 20170 transitions. [2021-06-12 16:22:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 16:22:34,653 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2021-06-12 16:22:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:22:34,661 INFO L225 Difference]: With dead ends: 5590 [2021-06-12 16:22:34,661 INFO L226 Difference]: Without dead ends: 3060 [2021-06-12 16:22:34,661 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 208.5ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-06-12 16:22:34,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2021-06-12 16:22:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 3060. [2021-06-12 16:22:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3059 states have (on average 3.5697940503432495) internal successors, (10920), 3059 states have internal predecessors, (10920), 0 states have call successors, (0), 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:22:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 10920 transitions. [2021-06-12 16:22:34,724 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 10920 transitions. Word has length 99 [2021-06-12 16:22:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:22:34,724 INFO L482 AbstractCegarLoop]: Abstraction has 3060 states and 10920 transitions. [2021-06-12 16:22:34,724 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 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:22:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 10920 transitions. [2021-06-12 16:22:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-12 16:22:34,730 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:22:34,730 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] [2021-06-12 16:22:34,730 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-12 16:22:34,730 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:22:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:22:34,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1580220514, now seen corresponding path program 3 times [2021-06-12 16:22:34,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:22:34,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910182806] [2021-06-12 16:22:34,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:22:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 16:22:34,772 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 16:22:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 16:22:34,814 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 16:22:34,866 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 16:22:34,867 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 16:22:34,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-12 16:22:34,867 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-12 16:22:34,868 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 16:22:35,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 04:22:35 BasicIcfg [2021-06-12 16:22:35,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 16:22:35,148 INFO L168 Benchmark]: Toolchain (without parser) took 151874.36 ms. Allocated memory was 186.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 150.2 MB in the beginning and 5.5 GB in the end (delta: -5.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 8.0 GB. [2021-06-12 16:22:35,148 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 186.6 MB. Free memory is still 168.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 16:22:35,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.61 ms. Allocated memory is still 186.6 MB. Free memory was 150.0 MB in the beginning and 145.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-06-12 16:22:35,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.65 ms. Allocated memory is still 186.6 MB. Free memory was 145.8 MB in the beginning and 142.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-12 16:22:35,149 INFO L168 Benchmark]: Boogie Preprocessor took 29.73 ms. Allocated memory is still 186.6 MB. Free memory was 142.7 MB in the beginning and 140.6 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:22:35,149 INFO L168 Benchmark]: RCFGBuilder took 1927.14 ms. Allocated memory was 186.6 MB in the beginning and 233.8 MB in the end (delta: 47.2 MB). Free memory was 140.1 MB in the beginning and 196.3 MB in the end (delta: -56.2 MB). Peak memory consumption was 93.8 MB. Max. memory is 8.0 GB. [2021-06-12 16:22:35,153 INFO L168 Benchmark]: TraceAbstraction took 149242.32 ms. Allocated memory was 233.8 MB in the beginning and 8.0 GB in the end (delta: 7.7 GB). Free memory was 195.7 MB in the beginning and 5.5 GB in the end (delta: -5.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 8.0 GB. [2021-06-12 16:22:35,153 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.15 ms. Allocated memory is still 186.6 MB. Free memory is still 168.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 585.61 ms. Allocated memory is still 186.6 MB. Free memory was 150.0 MB in the beginning and 145.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 84.65 ms. Allocated memory is still 186.6 MB. Free memory was 145.8 MB in the beginning and 142.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.73 ms. Allocated memory is still 186.6 MB. Free memory was 142.7 MB in the beginning and 140.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1927.14 ms. Allocated memory was 186.6 MB in the beginning and 233.8 MB in the end (delta: 47.2 MB). Free memory was 140.1 MB in the beginning and 196.3 MB in the end (delta: -56.2 MB). Peak memory consumption was 93.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 149242.32 ms. Allocated memory was 233.8 MB in the beginning and 8.0 GB in the end (delta: 7.7 GB). Free memory was 195.7 MB in the beginning and 5.5 GB in the end (delta: -5.3 GB). Peak memory consumption was 2.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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L726] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L727] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L728] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L729] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L730] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L731] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L736] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t577; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t578; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t579; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t580; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p2_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p2_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p2_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2 with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 32815.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 1631.3ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 31180.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135557occurred 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: P2Thread1of1ForFork2 with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 31491.5ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 300.9ms, AutomataDifference: 2227.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 28642.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 115 SDtfs, 51 SDslu, 86 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135557occurred 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: 7.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 6.4ms SsaConstructionTime, 39.7ms SatisfiabilityAnalysisTime, 176.0ms InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 115 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 84539.1ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 2478.8ms, AutomataDifference: 20351.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27669.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3132 SDtfs, 6442 SDslu, 12691 SDs, 0 SdLazy, 1403 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1545.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 3967.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135557occurred in iteration=0, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 29325.9ms AutomataMinimizationTime, 17 MinimizatonAttempts, 32393 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 66.1ms SsaConstructionTime, 971.7ms SatisfiabilityAnalysisTime, 3301.9ms InterpolantComputationTime, 1610 NumberOfCodeBlocks, 1610 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1494 ConstructedInterpolants, 0 QuantifiedInterpolants, 9530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...