/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:39:06,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:39:06,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:39:06,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:39:06,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:39:06,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:39:06,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:39:06,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:39:06,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:39:06,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:39:06,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:39:06,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:39:06,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:39:06,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:39:06,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:39:06,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:39:06,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:39:06,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:39:06,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:39:06,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:39:06,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:39:06,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:39:06,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:39:06,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:39:06,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:39:06,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:39:06,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:39:06,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:39:06,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:39:06,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:39:06,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:39:06,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:39:06,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:39:06,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:39:06,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:39:06,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:39:06,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:39:06,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:39:06,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:39:06,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:39:06,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:39:06,709 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:39:06,731 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:39:06,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:39:06,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:39:06,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:39:06,733 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:39:06,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:39:06,733 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:39:06,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:39:06,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:39:06,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:39:06,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:39:06,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:39:06,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:39:06,734 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:39:06,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:39:06,735 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:39:06,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:39:06,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:39:06,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:39:06,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:39:06,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:39:06,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:39:06,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:39:06,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:39:06,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:39:06,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:39:06,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:39:06,737 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:39:06,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:39:07,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:39:07,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:39:07,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:39:07,046 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:39:07,047 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:39:07,047 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2020-10-05 23:39:07,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3b2b0a9/fcf4a09c6d464598861e7a49f95857f9/FLAGa841b8a32 [2020-10-05 23:39:07,719 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:39:07,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2020-10-05 23:39:07,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3b2b0a9/fcf4a09c6d464598861e7a49f95857f9/FLAGa841b8a32 [2020-10-05 23:39:07,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3b2b0a9/fcf4a09c6d464598861e7a49f95857f9 [2020-10-05 23:39:07,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:39:07,978 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:39:07,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:39:07,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:39:07,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:39:07,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:39:07" (1/1) ... [2020-10-05 23:39:07,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55409b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:07, skipping insertion in model container [2020-10-05 23:39:07,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:39:07" (1/1) ... [2020-10-05 23:39:07,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:39:08,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:39:08,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:39:08,612 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:39:08,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:39:08,758 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:39:08,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08 WrapperNode [2020-10-05 23:39:08,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:39:08,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:39:08,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:39:08,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:39:08,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... [2020-10-05 23:39:08,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... [2020-10-05 23:39:08,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:39:08,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:39:08,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:39:08,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:39:08,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... [2020-10-05 23:39:08,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... [2020-10-05 23:39:08,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... [2020-10-05 23:39:08,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... [2020-10-05 23:39:08,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... [2020-10-05 23:39:08,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... [2020-10-05 23:39:08,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... [2020-10-05 23:39:08,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:39:08,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:39:08,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:39:08,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:39:08,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:39:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:39:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:39:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:39:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:39:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:39:08,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:39:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:39:08,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:39:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:39:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:39:08,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:39:08,934 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:39:10,895 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:39:10,895 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:39:10,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:39:10 BoogieIcfgContainer [2020-10-05 23:39:10,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:39:10,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:39:10,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:39:10,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:39:10,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:39:07" (1/3) ... [2020-10-05 23:39:10,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656ca36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:39:10, skipping insertion in model container [2020-10-05 23:39:10,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:08" (2/3) ... [2020-10-05 23:39:10,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656ca36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:39:10, skipping insertion in model container [2020-10-05 23:39:10,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:39:10" (3/3) ... [2020-10-05 23:39:10,907 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2020-10-05 23:39:10,918 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:39:10,919 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:39:10,927 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:39:10,928 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:39:10,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,959 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,962 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,970 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,974 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,974 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:39:10,991 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 23:39:11,014 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:39:11,014 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:39:11,014 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:39:11,014 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:39:11,014 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:39:11,015 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:39:11,015 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:39:11,015 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:39:11,031 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-05 23:39:11,033 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-05 23:39:11,074 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-05 23:39:11,074 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:39:11,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-05 23:39:11,082 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-05 23:39:11,101 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-05 23:39:11,102 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:39:11,103 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-05 23:39:11,104 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 896 [2020-10-05 23:39:11,106 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:39:12,922 WARN L193 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 224 DAG size of output: 183 [2020-10-05 23:39:12,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-05 23:39:12,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:39:12,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 23:39:12,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:39:14,000 WARN L193 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2020-10-05 23:39:14,848 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:39:16,081 WARN L193 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2020-10-05 23:39:16,378 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-05 23:39:17,357 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-05 23:39:17,746 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-05 23:39:18,064 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-05 23:39:18,202 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-05 23:39:18,213 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2325 [2020-10-05 23:39:18,214 INFO L214 etLargeBlockEncoding]: Total number of compositions: 64 [2020-10-05 23:39:18,218 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-05 23:39:18,253 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-05 23:39:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-05 23:39:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:39:18,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:18,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:39:18,292 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 897514, now seen corresponding path program 1 times [2020-10-05 23:39:18,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:18,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571913062] [2020-10-05 23:39:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:18,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571913062] [2020-10-05 23:39:18,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:18,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:18,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223514910] [2020-10-05 23:39:18,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:18,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:18,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:18,610 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-05 23:39:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:18,698 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-05 23:39:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:18,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:39:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:18,717 INFO L225 Difference]: With dead ends: 137 [2020-10-05 23:39:18,717 INFO L226 Difference]: Without dead ends: 112 [2020-10-05 23:39:18,718 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-05 23:39:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-05 23:39:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-05 23:39:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-05 23:39:18,764 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-05 23:39:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:18,765 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-05 23:39:18,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-05 23:39:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:39:18,766 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:18,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:18,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:39:18,766 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:18,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash -13139348, now seen corresponding path program 1 times [2020-10-05 23:39:18,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:18,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288777136] [2020-10-05 23:39:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:18,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288777136] [2020-10-05 23:39:18,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:18,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:18,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172384399] [2020-10-05 23:39:18,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:18,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:18,880 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-05 23:39:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:18,906 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-05 23:39:18,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:18,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:39:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:18,909 INFO L225 Difference]: With dead ends: 111 [2020-10-05 23:39:18,909 INFO L226 Difference]: Without dead ends: 111 [2020-10-05 23:39:18,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-05 23:39:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-05 23:39:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-05 23:39:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-05 23:39:18,923 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-05 23:39:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:18,923 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-05 23:39:18,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-05 23:39:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:39:18,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:18,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:18,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:39:18,925 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash -936774400, now seen corresponding path program 1 times [2020-10-05 23:39:18,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:18,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875890423] [2020-10-05 23:39:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:19,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875890423] [2020-10-05 23:39:19,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:19,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:39:19,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263883880] [2020-10-05 23:39:19,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:39:19,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:19,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:39:19,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:19,149 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 5 states. [2020-10-05 23:39:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:19,204 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-10-05 23:39:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:39:19,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-05 23:39:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:19,207 INFO L225 Difference]: With dead ends: 107 [2020-10-05 23:39:19,207 INFO L226 Difference]: Without dead ends: 107 [2020-10-05 23:39:19,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-05 23:39:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-05 23:39:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-05 23:39:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-10-05 23:39:19,218 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-10-05 23:39:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:19,218 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-10-05 23:39:19,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:39:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-10-05 23:39:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:39:19,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:19,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:19,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:39:19,220 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:19,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash -407351812, now seen corresponding path program 1 times [2020-10-05 23:39:19,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:19,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230643683] [2020-10-05 23:39:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:19,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230643683] [2020-10-05 23:39:19,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:19,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:39:19,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492204272] [2020-10-05 23:39:19,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:39:19,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:19,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:39:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:19,299 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 5 states. [2020-10-05 23:39:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:19,384 INFO L93 Difference]: Finished difference Result 103 states and 230 transitions. [2020-10-05 23:39:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:39:19,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-05 23:39:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:19,386 INFO L225 Difference]: With dead ends: 103 [2020-10-05 23:39:19,386 INFO L226 Difference]: Without dead ends: 103 [2020-10-05 23:39:19,386 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:39:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-05 23:39:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-05 23:39:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-05 23:39:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 230 transitions. [2020-10-05 23:39:19,395 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 230 transitions. Word has length 8 [2020-10-05 23:39:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:19,395 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 230 transitions. [2020-10-05 23:39:19,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:39:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 230 transitions. [2020-10-05 23:39:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:39:19,397 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:19,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:19,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:39:19,397 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:19,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1024732648, now seen corresponding path program 1 times [2020-10-05 23:39:19,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:19,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410928745] [2020-10-05 23:39:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:19,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410928745] [2020-10-05 23:39:19,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:19,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:39:19,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093204494] [2020-10-05 23:39:19,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:39:19,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:39:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:39:19,502 INFO L87 Difference]: Start difference. First operand 103 states and 230 transitions. Second operand 4 states. [2020-10-05 23:39:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:19,534 INFO L93 Difference]: Finished difference Result 135 states and 294 transitions. [2020-10-05 23:39:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:39:19,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-05 23:39:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:19,536 INFO L225 Difference]: With dead ends: 135 [2020-10-05 23:39:19,536 INFO L226 Difference]: Without dead ends: 75 [2020-10-05 23:39:19,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-05 23:39:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-10-05 23:39:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-05 23:39:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 155 transitions. [2020-10-05 23:39:19,548 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 155 transitions. Word has length 9 [2020-10-05 23:39:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:19,549 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 155 transitions. [2020-10-05 23:39:19,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:39:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 155 transitions. [2020-10-05 23:39:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:39:19,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:19,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:19,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:39:19,554 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:19,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1700985471, now seen corresponding path program 1 times [2020-10-05 23:39:19,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:19,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8405360] [2020-10-05 23:39:19,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:19,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8405360] [2020-10-05 23:39:19,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:19,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:39:19,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718321957] [2020-10-05 23:39:19,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:39:19,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:39:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:19,831 INFO L87 Difference]: Start difference. First operand 75 states and 155 transitions. Second operand 5 states. [2020-10-05 23:39:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:19,898 INFO L93 Difference]: Finished difference Result 74 states and 152 transitions. [2020-10-05 23:39:19,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:39:19,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-05 23:39:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:19,901 INFO L225 Difference]: With dead ends: 74 [2020-10-05 23:39:19,901 INFO L226 Difference]: Without dead ends: 74 [2020-10-05 23:39:19,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:39:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-05 23:39:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-05 23:39:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-05 23:39:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 152 transitions. [2020-10-05 23:39:19,913 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 152 transitions. Word has length 10 [2020-10-05 23:39:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:19,913 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 152 transitions. [2020-10-05 23:39:19,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:39:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 152 transitions. [2020-10-05 23:39:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:39:19,914 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:19,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:19,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:39:19,915 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:19,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:19,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1190886961, now seen corresponding path program 1 times [2020-10-05 23:39:19,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:19,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062873641] [2020-10-05 23:39:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:20,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062873641] [2020-10-05 23:39:20,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:20,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:39:20,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824395] [2020-10-05 23:39:20,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:39:20,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:20,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:39:20,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:39:20,161 INFO L87 Difference]: Start difference. First operand 74 states and 152 transitions. Second operand 6 states. [2020-10-05 23:39:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:20,268 INFO L93 Difference]: Finished difference Result 81 states and 165 transitions. [2020-10-05 23:39:20,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:39:20,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-05 23:39:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:20,271 INFO L225 Difference]: With dead ends: 81 [2020-10-05 23:39:20,271 INFO L226 Difference]: Without dead ends: 81 [2020-10-05 23:39:20,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:39:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-05 23:39:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-10-05 23:39:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-05 23:39:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 162 transitions. [2020-10-05 23:39:20,279 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 162 transitions. Word has length 11 [2020-10-05 23:39:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:20,279 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 162 transitions. [2020-10-05 23:39:20,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:39:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 162 transitions. [2020-10-05 23:39:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:39:20,280 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:20,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:20,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:39:20,281 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:20,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:20,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1190881195, now seen corresponding path program 1 times [2020-10-05 23:39:20,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:20,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136828141] [2020-10-05 23:39:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:20,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136828141] [2020-10-05 23:39:20,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:20,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:39:20,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932426896] [2020-10-05 23:39:20,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:39:20,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:20,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:39:20,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:39:20,364 INFO L87 Difference]: Start difference. First operand 79 states and 162 transitions. Second operand 4 states. [2020-10-05 23:39:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:20,389 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2020-10-05 23:39:20,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:39:20,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 23:39:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:20,392 INFO L225 Difference]: With dead ends: 72 [2020-10-05 23:39:20,392 INFO L226 Difference]: Without dead ends: 53 [2020-10-05 23:39:20,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-05 23:39:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-05 23:39:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-05 23:39:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 88 transitions. [2020-10-05 23:39:20,396 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 88 transitions. Word has length 11 [2020-10-05 23:39:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:20,397 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 88 transitions. [2020-10-05 23:39:20,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:39:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 88 transitions. [2020-10-05 23:39:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:39:20,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:20,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:20,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:39:20,398 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:20,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1851063238, now seen corresponding path program 1 times [2020-10-05 23:39:20,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:20,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355026231] [2020-10-05 23:39:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:20,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355026231] [2020-10-05 23:39:20,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:20,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:39:20,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886713711] [2020-10-05 23:39:20,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:39:20,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:20,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:39:20,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:20,499 INFO L87 Difference]: Start difference. First operand 53 states and 88 transitions. Second operand 5 states. [2020-10-05 23:39:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:20,536 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2020-10-05 23:39:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:39:20,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:39:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:20,538 INFO L225 Difference]: With dead ends: 42 [2020-10-05 23:39:20,538 INFO L226 Difference]: Without dead ends: 34 [2020-10-05 23:39:20,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:39:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-05 23:39:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-10-05 23:39:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-05 23:39:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-10-05 23:39:20,541 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 12 [2020-10-05 23:39:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:20,541 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-10-05 23:39:20,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:39:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-10-05 23:39:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:39:20,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:20,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:20,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:39:20,542 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash -944183904, now seen corresponding path program 1 times [2020-10-05 23:39:20,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:20,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421430239] [2020-10-05 23:39:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:39:20,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:39:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:39:20,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:39:20,654 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:39:20,654 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:39:20,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:39:20,655 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:39:20,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L2-->L795: Formula: (let ((.cse9 (= (mod ~y$w_buff1_used~0_In-1636947520 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1636947520 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-1636947520 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In-1636947520 256) 0))) (let ((.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1636947520 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1636947520|) (= ~y$r_buff0_thd0~0_In-1636947520 ~y$r_buff0_thd0~0_Out-1636947520) (or (and .cse0 (= ~y$w_buff1_used~0_In-1636947520 ~y$w_buff1_used~0_Out-1636947520)) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-1636947520 0))) (= ~y$r_buff1_thd0~0_Out-1636947520 ~y$r_buff1_thd0~0_In-1636947520) (or (and (= ~y$w_buff0_used~0_Out-1636947520 0) .cse3 .cse4) (and .cse5 (= ~y$w_buff0_used~0_Out-1636947520 ~y$w_buff0_used~0_In-1636947520))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1636947520 0)) (or (and (= ~y$w_buff0~0_In-1636947520 ~y~0_Out-1636947520) .cse3 .cse4) (and (or (and .cse0 (= ~y~0_Out-1636947520 ~y~0_In-1636947520)) (and .cse1 (= ~y$w_buff1~0_In-1636947520 ~y~0_Out-1636947520) .cse2)) .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1636947520|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1636947520, ~y$w_buff1~0=~y$w_buff1~0_In-1636947520, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1636947520, ~y$w_buff0~0=~y$w_buff0~0_In-1636947520, ~y~0=~y~0_In-1636947520, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1636947520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1636947520} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1636947520, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1636947520|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1636947520|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1636947520|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1636947520|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1636947520|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1636947520|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1636947520|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1636947520, ~y$w_buff1~0=~y$w_buff1~0_In-1636947520, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1636947520, ~y$w_buff0~0=~y$w_buff0~0_In-1636947520, ~y~0=~y~0_Out-1636947520, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1636947520, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1636947520} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-05 23:39:20,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,673 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:20,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:20,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:39:20 BasicIcfg [2020-10-05 23:39:20,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:39:20,727 INFO L168 Benchmark]: Toolchain (without parser) took 12749.67 ms. Allocated memory was 140.5 MB in the beginning and 348.7 MB in the end (delta: 208.1 MB). Free memory was 101.8 MB in the beginning and 228.4 MB in the end (delta: -126.6 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:20,728 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:39:20,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.90 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.6 MB in the beginning and 157.1 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:20,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.45 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:20,730 INFO L168 Benchmark]: Boogie Preprocessor took 43.53 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:20,731 INFO L168 Benchmark]: RCFGBuilder took 2027.30 ms. Allocated memory was 203.4 MB in the beginning and 245.4 MB in the end (delta: 41.9 MB). Free memory was 152.0 MB in the beginning and 192.4 MB in the end (delta: -40.4 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:20,732 INFO L168 Benchmark]: TraceAbstraction took 9825.46 ms. Allocated memory was 245.4 MB in the beginning and 348.7 MB in the end (delta: 103.3 MB). Free memory was 192.4 MB in the beginning and 228.4 MB in the end (delta: -36.0 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:20,736 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.90 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.6 MB in the beginning and 157.1 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.45 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.53 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2027.30 ms. Allocated memory was 203.4 MB in the beginning and 245.4 MB in the end (delta: 41.9 MB). Free memory was 152.0 MB in the beginning and 192.4 MB in the end (delta: -40.4 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9825.46 ms. Allocated memory was 245.4 MB in the beginning and 348.7 MB in the end (delta: 103.3 MB). Free memory was 192.4 MB in the beginning and 228.4 MB in the end (delta: -36.0 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.1s, 80 ProgramPointsBefore, 26 ProgramPointsAfterwards, 75 TransitionsBefore, 19 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 451 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2325 CheckedPairsTotal, 64 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L705] 0 int y = 0; [L706] 0 _Bool y$flush_delayed; [L707] 0 int y$mem_tmp; [L708] 0 _Bool y$r_buff0_thd0; [L709] 0 _Bool y$r_buff0_thd1; [L710] 0 _Bool y$r_buff0_thd2; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$read_delayed; [L715] 0 int *y$read_delayed_var; [L716] 0 int y$w_buff0; [L717] 0 _Bool y$w_buff0_used; [L718] 0 int y$w_buff1; [L719] 0 _Bool y$w_buff1_used; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t2017; [L782] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L725] 1 y$w_buff1 = y$w_buff0 [L726] 1 y$w_buff0 = 2 [L727] 1 y$w_buff1_used = y$w_buff0_used [L728] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L783] 0 pthread_t t2018; [L784] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L753] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L756] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] 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) [L759] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L759] 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) [L759] 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) [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L761] 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 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 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 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L748] 1 return 0; [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 y$flush_delayed = weak$$choice2 [L800] 0 y$mem_tmp = y [L801] 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) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L801] 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) [L801] 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) [L802] 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)) [L802] EXPR 0 !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) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L802] EXPR 0 !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) [L802] 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)) [L802] 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)) [L803] 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)) [L803] EXPR 0 !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) [L803] 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)) [L803] 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)) [L804] 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)) [L804] EXPR 0 !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) [L804] 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)) [L804] 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)) [L805] 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)) [L805] EXPR 0 !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) [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L805] EXPR 0 !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) [L805] 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)) [L805] 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)) [L806] 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)) [L806] 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)) [L807] 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)) [L807] 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)) [L808] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L809] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L809] 0 y = y$flush_delayed ? y$mem_tmp : y [L810] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 121 SDtfs, 110 SDslu, 158 SDs, 0 SdLazy, 146 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 5151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...