/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/mix030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:57:50,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:57:50,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:57:50,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:57:50,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:57:50,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:57:50,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:57:50,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:57:50,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:57:50,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:57:50,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:57:50,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:57:50,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:57:50,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:57:50,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:57:50,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:57:50,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:57:50,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:57:50,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:57:50,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:57:50,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:57:50,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:57:50,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:57:50,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:57:50,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:57:50,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:57:50,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:57:50,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:57:50,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:57:50,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:57:50,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:57:50,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:57:50,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:57:50,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:57:50,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:57:50,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:57:50,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:57:50,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:57:50,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:57:50,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:57:50,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:57:50,730 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-21 22:57:50,777 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:57:50,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:57:50,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:57:50,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:57:50,779 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:57:50,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:57:50,780 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:57:50,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:57:50,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:57:50,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:57:50,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:57:50,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:57:50,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:57:50,782 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:57:50,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:57:50,782 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:57:50,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:57:50,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:57:50,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:57:50,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:57:50,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:57:50,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:57:50,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:57:50,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 22:57:50,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:57:50,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:57:50,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:57:50,785 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 22:57:50,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:57:51,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:57:51,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:57:51,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:57:51,105 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:57:51,105 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:57:51,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i [2020-10-21 22:57:51,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407c651f9/1e4833e4dcc847b78c04215caf15fe23/FLAG896ba46e8 [2020-10-21 22:57:51,751 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:57:51,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i [2020-10-21 22:57:51,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407c651f9/1e4833e4dcc847b78c04215caf15fe23/FLAG896ba46e8 [2020-10-21 22:57:52,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407c651f9/1e4833e4dcc847b78c04215caf15fe23 [2020-10-21 22:57:52,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:57:52,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:57:52,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:57:52,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:57:52,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:57:52,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2100e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52, skipping insertion in model container [2020-10-21 22:57:52,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:57:52,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:57:52,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:57:52,665 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:57:52,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:57:52,805 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:57:52,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52 WrapperNode [2020-10-21 22:57:52,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:57:52,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:57:52,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:57:52,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:57:52,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:57:52,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:57:52,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:57:52,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:57:52,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (1/1) ... [2020-10-21 22:57:52,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:57:52,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:57:52,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:57:52,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:57:52,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (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-21 22:57:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:57:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:57:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:57:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:57:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:57:52,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:57:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:57:52,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:57:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 22:57:52,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 22:57:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 22:57:52,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 22:57:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:57:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:57:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:57:52,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:57:52,992 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:57:55,099 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:57:55,100 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:57:55,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:57:55 BoogieIcfgContainer [2020-10-21 22:57:55,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:57:55,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:57:55,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:57:55,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:57:55,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:57:52" (1/3) ... [2020-10-21 22:57:55,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ac1abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:57:55, skipping insertion in model container [2020-10-21 22:57:55,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:52" (2/3) ... [2020-10-21 22:57:55,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ac1abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:57:55, skipping insertion in model container [2020-10-21 22:57:55,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:57:55" (3/3) ... [2020-10-21 22:57:55,111 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_rmo.opt.i [2020-10-21 22:57:55,122 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:57:55,122 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:57:55,130 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:57:55,131 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:57:55,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,162 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,163 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,164 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,164 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,168 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,168 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,168 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,168 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,169 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,170 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,173 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,173 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,179 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,179 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,182 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,189 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,189 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,194 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,194 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:55,196 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:57:55,209 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 22:57:55,230 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:57:55,230 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:57:55,230 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 22:57:55,230 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:57:55,230 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:57:55,231 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:57:55,231 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:57:55,231 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:57:55,245 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 22:57:55,246 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 119 transitions, 258 flow [2020-10-21 22:57:55,248 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 119 transitions, 258 flow [2020-10-21 22:57:55,250 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 119 transitions, 258 flow [2020-10-21 22:57:55,302 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-10-21 22:57:55,303 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:57:55,308 INFO L80 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-21 22:57:55,312 INFO L116 LiptonReduction]: Number of co-enabled transitions 2862 [2020-10-21 22:57:56,718 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-21 22:57:56,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-21 22:57:56,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:57:56,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-21 22:57:56,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:57:57,915 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-21 22:57:58,191 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 22:58:00,071 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-21 22:58:00,416 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-21 22:58:01,586 WARN L193 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 137 [2020-10-21 22:58:01,885 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-21 22:58:02,533 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2020-10-21 22:58:02,834 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-21 22:58:03,070 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-21 22:58:03,238 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-21 22:58:03,692 WARN L193 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2020-10-21 22:58:03,879 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-21 22:58:03,892 INFO L131 LiptonReduction]: Checked pairs total: 8274 [2020-10-21 22:58:03,892 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-10-21 22:58:03,899 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-21 22:58:04,134 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-21 22:58:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-21 22:58:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 22:58:04,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:04,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:04,149 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash -162394625, now seen corresponding path program 1 times [2020-10-21 22:58:04,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:04,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153744444] [2020-10-21 22:58:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:04,466 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-21 22:58:04,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153744444] [2020-10-21 22:58:04,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:04,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:04,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780851099] [2020-10-21 22:58:04,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:04,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:04,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:04,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:04,491 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-21 22:58:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:04,635 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-21 22:58:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:04,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 22:58:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:04,679 INFO L225 Difference]: With dead ends: 3250 [2020-10-21 22:58:04,680 INFO L226 Difference]: Without dead ends: 2650 [2020-10-21 22:58:04,681 INFO L677 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-21 22:58:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-21 22:58:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-21 22:58:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-21 22:58:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-21 22:58:04,950 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-21 22:58:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:04,952 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-21 22:58:04,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-21 22:58:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:58:04,955 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:04,955 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:04,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:58:04,955 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:04,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:04,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1169447099, now seen corresponding path program 1 times [2020-10-21 22:58:04,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:04,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188435165] [2020-10-21 22:58:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:05,075 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-21 22:58:05,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188435165] [2020-10-21 22:58:05,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:05,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:05,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678200157] [2020-10-21 22:58:05,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:05,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:05,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:05,079 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-21 22:58:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:05,121 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-10-21 22:58:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:05,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 22:58:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:05,143 INFO L225 Difference]: With dead ends: 2450 [2020-10-21 22:58:05,143 INFO L226 Difference]: Without dead ends: 2450 [2020-10-21 22:58:05,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-10-21 22:58:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-10-21 22:58:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-10-21 22:58:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-10-21 22:58:05,236 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 11 [2020-10-21 22:58:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:05,236 INFO L481 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-10-21 22:58:05,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-10-21 22:58:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:58:05,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:05,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:05,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:58:05,241 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:05,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:05,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1430917360, now seen corresponding path program 1 times [2020-10-21 22:58:05,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:05,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992734859] [2020-10-21 22:58:05,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:05,312 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-21 22:58:05,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992734859] [2020-10-21 22:58:05,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:05,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:05,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178716822] [2020-10-21 22:58:05,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:05,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:05,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:05,315 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states. [2020-10-21 22:58:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:05,343 INFO L93 Difference]: Finished difference Result 2410 states and 9176 transitions. [2020-10-21 22:58:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:05,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-21 22:58:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:05,365 INFO L225 Difference]: With dead ends: 2410 [2020-10-21 22:58:05,365 INFO L226 Difference]: Without dead ends: 2410 [2020-10-21 22:58:05,366 INFO L677 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-21 22:58:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-21 22:58:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-21 22:58:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-21 22:58:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9176 transitions. [2020-10-21 22:58:05,449 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9176 transitions. Word has length 13 [2020-10-21 22:58:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:05,450 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9176 transitions. [2020-10-21 22:58:05,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9176 transitions. [2020-10-21 22:58:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 22:58:05,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:05,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:05,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:58:05,453 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2047578604, now seen corresponding path program 1 times [2020-10-21 22:58:05,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:05,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257767751] [2020-10-21 22:58:05,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:05,526 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-21 22:58:05,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257767751] [2020-10-21 22:58:05,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:05,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:05,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342744509] [2020-10-21 22:58:05,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:05,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:05,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:05,529 INFO L87 Difference]: Start difference. First operand 2410 states and 9176 transitions. Second operand 3 states. [2020-10-21 22:58:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:05,592 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-10-21 22:58:05,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:05,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-21 22:58:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:05,613 INFO L225 Difference]: With dead ends: 2386 [2020-10-21 22:58:05,614 INFO L226 Difference]: Without dead ends: 2386 [2020-10-21 22:58:05,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-10-21 22:58:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-10-21 22:58:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-10-21 22:58:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-10-21 22:58:05,698 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14 [2020-10-21 22:58:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:05,699 INFO L481 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-10-21 22:58:05,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-10-21 22:58:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:58:05,702 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:05,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:05,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:58:05,703 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash 233598470, now seen corresponding path program 1 times [2020-10-21 22:58:05,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:05,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202654066] [2020-10-21 22:58:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:05,793 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-21 22:58:05,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202654066] [2020-10-21 22:58:05,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:05,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:05,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41727583] [2020-10-21 22:58:05,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:58:05,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:05,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:58:05,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:05,796 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states. [2020-10-21 22:58:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:05,886 INFO L93 Difference]: Finished difference Result 2338 states and 8870 transitions. [2020-10-21 22:58:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:05,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 22:58:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:05,906 INFO L225 Difference]: With dead ends: 2338 [2020-10-21 22:58:05,906 INFO L226 Difference]: Without dead ends: 2338 [2020-10-21 22:58:05,907 INFO L677 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-21 22:58:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2020-10-21 22:58:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2338. [2020-10-21 22:58:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-10-21 22:58:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 8870 transitions. [2020-10-21 22:58:05,983 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 8870 transitions. Word has length 15 [2020-10-21 22:58:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:05,984 INFO L481 AbstractCegarLoop]: Abstraction has 2338 states and 8870 transitions. [2020-10-21 22:58:05,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:58:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 8870 transitions. [2020-10-21 22:58:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:58:06,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:06,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:06,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:58:06,055 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1894098725, now seen corresponding path program 1 times [2020-10-21 22:58:06,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:06,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014007763] [2020-10-21 22:58:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:06,163 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-21 22:58:06,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014007763] [2020-10-21 22:58:06,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:06,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:06,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378298131] [2020-10-21 22:58:06,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:58:06,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:58:06,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:06,166 INFO L87 Difference]: Start difference. First operand 2338 states and 8870 transitions. Second operand 5 states. [2020-10-21 22:58:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:06,271 INFO L93 Difference]: Finished difference Result 2410 states and 9134 transitions. [2020-10-21 22:58:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:06,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 22:58:06,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:06,306 INFO L225 Difference]: With dead ends: 2410 [2020-10-21 22:58:06,306 INFO L226 Difference]: Without dead ends: 2410 [2020-10-21 22:58:06,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-21 22:58:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-21 22:58:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-21 22:58:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions. [2020-10-21 22:58:06,386 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 15 [2020-10-21 22:58:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:06,389 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions. [2020-10-21 22:58:06,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:58:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions. [2020-10-21 22:58:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:58:06,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:06,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:06,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:58:06,399 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:06,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:06,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1495289419, now seen corresponding path program 1 times [2020-10-21 22:58:06,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:06,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503100012] [2020-10-21 22:58:06,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:06,551 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-21 22:58:06,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503100012] [2020-10-21 22:58:06,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:06,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:06,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592401692] [2020-10-21 22:58:06,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:58:06,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:06,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:58:06,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:06,554 INFO L87 Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 5 states. [2020-10-21 22:58:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:06,674 INFO L93 Difference]: Finished difference Result 2610 states and 9960 transitions. [2020-10-21 22:58:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:06,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 22:58:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:06,687 INFO L225 Difference]: With dead ends: 2610 [2020-10-21 22:58:06,687 INFO L226 Difference]: Without dead ends: 2610 [2020-10-21 22:58:06,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-21 22:58:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-21 22:58:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-21 22:58:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9960 transitions. [2020-10-21 22:58:06,767 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 9960 transitions. Word has length 16 [2020-10-21 22:58:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:06,768 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 9960 transitions. [2020-10-21 22:58:06,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:58:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 9960 transitions. [2020-10-21 22:58:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:58:06,772 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:06,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:06,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:58:06,773 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:06,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1348382509, now seen corresponding path program 2 times [2020-10-21 22:58:06,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:06,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70594515] [2020-10-21 22:58:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:06,852 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-21 22:58:06,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70594515] [2020-10-21 22:58:06,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:06,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:06,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444158075] [2020-10-21 22:58:06,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:06,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:06,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:06,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:06,855 INFO L87 Difference]: Start difference. First operand 2610 states and 9960 transitions. Second operand 6 states. [2020-10-21 22:58:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:06,943 INFO L93 Difference]: Finished difference Result 2666 states and 10158 transitions. [2020-10-21 22:58:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:06,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 22:58:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:06,955 INFO L225 Difference]: With dead ends: 2666 [2020-10-21 22:58:06,955 INFO L226 Difference]: Without dead ends: 2666 [2020-10-21 22:58:06,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2020-10-21 22:58:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2594. [2020-10-21 22:58:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2594 states. [2020-10-21 22:58:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 9900 transitions. [2020-10-21 22:58:07,028 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 9900 transitions. Word has length 16 [2020-10-21 22:58:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:07,028 INFO L481 AbstractCegarLoop]: Abstraction has 2594 states and 9900 transitions. [2020-10-21 22:58:07,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 9900 transitions. [2020-10-21 22:58:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:58:07,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:07,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:07,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:58:07,033 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:07,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash 983490767, now seen corresponding path program 3 times [2020-10-21 22:58:07,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:07,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631840905] [2020-10-21 22:58:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:07,147 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-21 22:58:07,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631840905] [2020-10-21 22:58:07,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:07,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:07,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386898881] [2020-10-21 22:58:07,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:07,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:07,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:07,153 INFO L87 Difference]: Start difference. First operand 2594 states and 9900 transitions. Second operand 6 states. [2020-10-21 22:58:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:07,254 INFO L93 Difference]: Finished difference Result 2834 states and 10752 transitions. [2020-10-21 22:58:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:07,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 22:58:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:07,266 INFO L225 Difference]: With dead ends: 2834 [2020-10-21 22:58:07,267 INFO L226 Difference]: Without dead ends: 2834 [2020-10-21 22:58:07,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-10-21 22:58:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2626. [2020-10-21 22:58:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2020-10-21 22:58:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 9932 transitions. [2020-10-21 22:58:07,367 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 9932 transitions. Word has length 16 [2020-10-21 22:58:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:07,368 INFO L481 AbstractCegarLoop]: Abstraction has 2626 states and 9932 transitions. [2020-10-21 22:58:07,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 9932 transitions. [2020-10-21 22:58:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 22:58:07,374 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:07,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:07,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:58:07,375 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:07,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash 220151462, now seen corresponding path program 1 times [2020-10-21 22:58:07,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:07,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420508089] [2020-10-21 22:58:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:07,643 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-21 22:58:07,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420508089] [2020-10-21 22:58:07,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:07,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:58:07,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709437258] [2020-10-21 22:58:07,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:58:07,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:58:07,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:07,645 INFO L87 Difference]: Start difference. First operand 2626 states and 9932 transitions. Second operand 7 states. [2020-10-21 22:58:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:07,760 INFO L93 Difference]: Finished difference Result 3154 states and 11952 transitions. [2020-10-21 22:58:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:07,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 22:58:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:07,780 INFO L225 Difference]: With dead ends: 3154 [2020-10-21 22:58:07,780 INFO L226 Difference]: Without dead ends: 3154 [2020-10-21 22:58:07,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2020-10-21 22:58:07,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 2994. [2020-10-21 22:58:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2020-10-21 22:58:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 11280 transitions. [2020-10-21 22:58:07,880 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 11280 transitions. Word has length 17 [2020-10-21 22:58:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:07,880 INFO L481 AbstractCegarLoop]: Abstraction has 2994 states and 11280 transitions. [2020-10-21 22:58:07,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:58:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 11280 transitions. [2020-10-21 22:58:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 22:58:07,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:07,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:07,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:58:07,887 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:07,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1533933320, now seen corresponding path program 2 times [2020-10-21 22:58:07,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:07,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850371346] [2020-10-21 22:58:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:08,071 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-21 22:58:08,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850371346] [2020-10-21 22:58:08,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:08,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:58:08,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835234654] [2020-10-21 22:58:08,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:58:08,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:08,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:58:08,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:08,073 INFO L87 Difference]: Start difference. First operand 2994 states and 11280 transitions. Second operand 7 states. [2020-10-21 22:58:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:08,240 INFO L93 Difference]: Finished difference Result 3738 states and 14098 transitions. [2020-10-21 22:58:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:58:08,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 22:58:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:08,251 INFO L225 Difference]: With dead ends: 3738 [2020-10-21 22:58:08,251 INFO L226 Difference]: Without dead ends: 3738 [2020-10-21 22:58:08,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:58:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2020-10-21 22:58:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3122. [2020-10-21 22:58:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-10-21 22:58:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 11848 transitions. [2020-10-21 22:58:08,341 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 11848 transitions. Word has length 17 [2020-10-21 22:58:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:08,341 INFO L481 AbstractCegarLoop]: Abstraction has 3122 states and 11848 transitions. [2020-10-21 22:58:08,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:58:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 11848 transitions. [2020-10-21 22:58:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 22:58:08,347 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:08,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:08,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:58:08,348 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:08,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1149812462, now seen corresponding path program 3 times [2020-10-21 22:58:08,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:08,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140817911] [2020-10-21 22:58:08,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:08,476 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-21 22:58:08,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140817911] [2020-10-21 22:58:08,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:08,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:58:08,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981723505] [2020-10-21 22:58:08,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:58:08,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:08,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:58:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:08,478 INFO L87 Difference]: Start difference. First operand 3122 states and 11848 transitions. Second operand 7 states. [2020-10-21 22:58:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:08,603 INFO L93 Difference]: Finished difference Result 3418 states and 12834 transitions. [2020-10-21 22:58:08,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:08,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 22:58:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:08,614 INFO L225 Difference]: With dead ends: 3418 [2020-10-21 22:58:08,614 INFO L226 Difference]: Without dead ends: 3418 [2020-10-21 22:58:08,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2020-10-21 22:58:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3106. [2020-10-21 22:58:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3106 states. [2020-10-21 22:58:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 11788 transitions. [2020-10-21 22:58:08,712 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 11788 transitions. Word has length 17 [2020-10-21 22:58:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:08,712 INFO L481 AbstractCegarLoop]: Abstraction has 3106 states and 11788 transitions. [2020-10-21 22:58:08,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:58:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 11788 transitions. [2020-10-21 22:58:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 22:58:08,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:08,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:08,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 22:58:08,720 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:08,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:08,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1615625476, now seen corresponding path program 1 times [2020-10-21 22:58:08,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:08,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598329154] [2020-10-21 22:58:08,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:08,819 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-21 22:58:08,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598329154] [2020-10-21 22:58:08,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:08,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:08,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074212311] [2020-10-21 22:58:08,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:58:08,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:08,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:58:08,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:08,821 INFO L87 Difference]: Start difference. First operand 3106 states and 11788 transitions. Second operand 4 states. [2020-10-21 22:58:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:08,863 INFO L93 Difference]: Finished difference Result 3220 states and 11162 transitions. [2020-10-21 22:58:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:08,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-21 22:58:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:08,883 INFO L225 Difference]: With dead ends: 3220 [2020-10-21 22:58:08,883 INFO L226 Difference]: Without dead ends: 2372 [2020-10-21 22:58:08,884 INFO L677 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-21 22:58:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2020-10-21 22:58:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2372. [2020-10-21 22:58:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2372 states. [2020-10-21 22:58:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 8118 transitions. [2020-10-21 22:58:09,016 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 8118 transitions. Word has length 17 [2020-10-21 22:58:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:09,016 INFO L481 AbstractCegarLoop]: Abstraction has 2372 states and 8118 transitions. [2020-10-21 22:58:09,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:58:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 8118 transitions. [2020-10-21 22:58:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 22:58:09,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:09,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:09,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 22:58:09,022 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:09,022 INFO L82 PathProgramCache]: Analyzing trace with hash -667234984, now seen corresponding path program 1 times [2020-10-21 22:58:09,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:09,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091821583] [2020-10-21 22:58:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:09,104 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-21 22:58:09,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091821583] [2020-10-21 22:58:09,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:09,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:09,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805342938] [2020-10-21 22:58:09,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:58:09,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:09,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:58:09,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:09,106 INFO L87 Difference]: Start difference. First operand 2372 states and 8118 transitions. Second operand 5 states. [2020-10-21 22:58:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:09,155 INFO L93 Difference]: Finished difference Result 2051 states and 6511 transitions. [2020-10-21 22:58:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:09,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-21 22:58:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:09,160 INFO L225 Difference]: With dead ends: 2051 [2020-10-21 22:58:09,160 INFO L226 Difference]: Without dead ends: 1539 [2020-10-21 22:58:09,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-21 22:58:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2020-10-21 22:58:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1539. [2020-10-21 22:58:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1539 states. [2020-10-21 22:58:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 4786 transitions. [2020-10-21 22:58:09,188 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 4786 transitions. Word has length 18 [2020-10-21 22:58:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:09,189 INFO L481 AbstractCegarLoop]: Abstraction has 1539 states and 4786 transitions. [2020-10-21 22:58:09,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:58:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 4786 transitions. [2020-10-21 22:58:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:58:09,193 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:09,193 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:09,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 22:58:09,193 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:09,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1868355780, now seen corresponding path program 1 times [2020-10-21 22:58:09,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:09,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771064570] [2020-10-21 22:58:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:09,234 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-21 22:58:09,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771064570] [2020-10-21 22:58:09,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:09,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:58:09,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413424202] [2020-10-21 22:58:09,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:09,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:09,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:09,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:09,236 INFO L87 Difference]: Start difference. First operand 1539 states and 4786 transitions. Second operand 3 states. [2020-10-21 22:58:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:09,255 INFO L93 Difference]: Finished difference Result 2243 states and 6795 transitions. [2020-10-21 22:58:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:09,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-21 22:58:09,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:09,259 INFO L225 Difference]: With dead ends: 2243 [2020-10-21 22:58:09,260 INFO L226 Difference]: Without dead ends: 1551 [2020-10-21 22:58:09,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2020-10-21 22:58:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1419. [2020-10-21 22:58:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2020-10-21 22:58:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4141 transitions. [2020-10-21 22:58:09,287 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4141 transitions. Word has length 20 [2020-10-21 22:58:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:09,288 INFO L481 AbstractCegarLoop]: Abstraction has 1419 states and 4141 transitions. [2020-10-21 22:58:09,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4141 transitions. [2020-10-21 22:58:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 22:58:09,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:09,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:09,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 22:58:09,292 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1472992942, now seen corresponding path program 1 times [2020-10-21 22:58:09,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:09,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828684407] [2020-10-21 22:58:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:09,353 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-21 22:58:09,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828684407] [2020-10-21 22:58:09,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:09,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:58:09,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818727990] [2020-10-21 22:58:09,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:09,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:09,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:09,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:09,356 INFO L87 Difference]: Start difference. First operand 1419 states and 4141 transitions. Second operand 6 states. [2020-10-21 22:58:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:09,438 INFO L93 Difference]: Finished difference Result 1254 states and 3619 transitions. [2020-10-21 22:58:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:58:09,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-21 22:58:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:09,443 INFO L225 Difference]: With dead ends: 1254 [2020-10-21 22:58:09,443 INFO L226 Difference]: Without dead ends: 1103 [2020-10-21 22:58:09,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:58:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-10-21 22:58:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 939. [2020-10-21 22:58:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2020-10-21 22:58:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 2727 transitions. [2020-10-21 22:58:09,467 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 2727 transitions. Word has length 21 [2020-10-21 22:58:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:09,468 INFO L481 AbstractCegarLoop]: Abstraction has 939 states and 2727 transitions. [2020-10-21 22:58:09,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 2727 transitions. [2020-10-21 22:58:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 22:58:09,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:09,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:09,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 22:58:09,471 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:09,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:09,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1449693238, now seen corresponding path program 1 times [2020-10-21 22:58:09,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:09,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028966168] [2020-10-21 22:58:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:09,554 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-21 22:58:09,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028966168] [2020-10-21 22:58:09,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:09,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 22:58:09,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067848410] [2020-10-21 22:58:09,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:58:09,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:09,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:58:09,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:09,557 INFO L87 Difference]: Start difference. First operand 939 states and 2727 transitions. Second operand 7 states. [2020-10-21 22:58:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:09,660 INFO L93 Difference]: Finished difference Result 909 states and 2666 transitions. [2020-10-21 22:58:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:58:09,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-21 22:58:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:09,664 INFO L225 Difference]: With dead ends: 909 [2020-10-21 22:58:09,664 INFO L226 Difference]: Without dead ends: 553 [2020-10-21 22:58:09,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-21 22:58:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-10-21 22:58:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 517. [2020-10-21 22:58:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-21 22:58:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1477 transitions. [2020-10-21 22:58:09,678 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1477 transitions. Word has length 24 [2020-10-21 22:58:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:09,678 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1477 transitions. [2020-10-21 22:58:09,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:58:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1477 transitions. [2020-10-21 22:58:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:09,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:09,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:09,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 22:58:09,681 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:09,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1532231772, now seen corresponding path program 1 times [2020-10-21 22:58:09,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:09,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615553634] [2020-10-21 22:58:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:09,734 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-21 22:58:09,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615553634] [2020-10-21 22:58:09,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:09,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:09,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694820400] [2020-10-21 22:58:09,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:58:09,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:58:09,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:09,736 INFO L87 Difference]: Start difference. First operand 517 states and 1477 transitions. Second operand 4 states. [2020-10-21 22:58:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:09,756 INFO L93 Difference]: Finished difference Result 684 states and 1931 transitions. [2020-10-21 22:58:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:09,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-21 22:58:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:09,758 INFO L225 Difference]: With dead ends: 684 [2020-10-21 22:58:09,758 INFO L226 Difference]: Without dead ends: 214 [2020-10-21 22:58:09,759 INFO L677 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-21 22:58:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-21 22:58:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-21 22:58:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-21 22:58:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2020-10-21 22:58:09,763 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 27 [2020-10-21 22:58:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:09,764 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2020-10-21 22:58:09,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:58:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2020-10-21 22:58:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:09,765 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:09,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:09,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 22:58:09,765 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash -165311702, now seen corresponding path program 2 times [2020-10-21 22:58:09,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:09,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997838462] [2020-10-21 22:58:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:09,867 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-21 22:58:09,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997838462] [2020-10-21 22:58:09,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:09,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:09,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805713844] [2020-10-21 22:58:09,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:09,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:09,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:09,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:09,869 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 6 states. [2020-10-21 22:58:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:09,920 INFO L93 Difference]: Finished difference Result 288 states and 725 transitions. [2020-10-21 22:58:09,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:09,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-21 22:58:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:09,922 INFO L225 Difference]: With dead ends: 288 [2020-10-21 22:58:09,922 INFO L226 Difference]: Without dead ends: 238 [2020-10-21 22:58:09,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-10-21 22:58:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 190. [2020-10-21 22:58:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-10-21 22:58:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 463 transitions. [2020-10-21 22:58:09,927 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 463 transitions. Word has length 27 [2020-10-21 22:58:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:09,927 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 463 transitions. [2020-10-21 22:58:09,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 463 transitions. [2020-10-21 22:58:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:09,928 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:09,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:09,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 22:58:09,928 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash 56148650, now seen corresponding path program 3 times [2020-10-21 22:58:09,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:09,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290286782] [2020-10-21 22:58:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:10,160 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-21 22:58:10,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290286782] [2020-10-21 22:58:10,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:10,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 22:58:10,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60045792] [2020-10-21 22:58:10,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 22:58:10,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:10,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 22:58:10,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:58:10,163 INFO L87 Difference]: Start difference. First operand 190 states and 463 transitions. Second operand 9 states. [2020-10-21 22:58:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:10,362 INFO L93 Difference]: Finished difference Result 279 states and 668 transitions. [2020-10-21 22:58:10,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 22:58:10,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-21 22:58:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:10,363 INFO L225 Difference]: With dead ends: 279 [2020-10-21 22:58:10,364 INFO L226 Difference]: Without dead ends: 219 [2020-10-21 22:58:10,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-21 22:58:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-10-21 22:58:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 168. [2020-10-21 22:58:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-21 22:58:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2020-10-21 22:58:10,369 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2020-10-21 22:58:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:10,370 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2020-10-21 22:58:10,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 22:58:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2020-10-21 22:58:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:10,371 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:10,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:10,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 22:58:10,371 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1947413876, now seen corresponding path program 4 times [2020-10-21 22:58:10,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:10,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837819369] [2020-10-21 22:58:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:58:10,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:58:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:58:10,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:58:10,478 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:58:10,479 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:58:10,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-21 22:58:10,480 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:58:10,496 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1112] [1112] L854-->L862: Formula: (let ((.cse8 (= (mod ~y$w_buff1_used~0_In1517541250 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In1517541250 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In1517541250 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In1517541250 256) 0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1517541250 0)) (or (and .cse0 (= ~y$w_buff1_used~0_Out1517541250 ~y$w_buff1_used~0_In1517541250)) (and (= ~y$w_buff1_used~0_Out1517541250 0) .cse1 .cse2)) (= (mod ~main$tmp_guard0~0_In1517541250 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out1517541250|) (= ~y$r_buff1_thd0~0_Out1517541250 ~y$r_buff1_thd0~0_In1517541250) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1517541250 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out1517541250|) (or (and (= ~y$w_buff0_used~0_In1517541250 ~y$w_buff0_used~0_Out1517541250) .cse3) (and .cse4 (= ~y$w_buff0_used~0_Out1517541250 0) .cse5)) (= ~y$r_buff0_thd0~0_Out1517541250 ~y$r_buff0_thd0~0_In1517541250) (or (and .cse4 .cse5 (= ~y$w_buff0~0_In1517541250 ~y~0_Out1517541250)) (and (or (and .cse0 (= ~y~0_In1517541250 ~y~0_Out1517541250)) (and (= ~y~0_Out1517541250 ~y$w_buff1~0_In1517541250) .cse1 .cse2)) .cse3))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1517541250, ~y$w_buff1~0=~y$w_buff1~0_In1517541250, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1517541250, ~y$w_buff0~0=~y$w_buff0~0_In1517541250, ~main$tmp_guard0~0=~main$tmp_guard0~0_In1517541250, ~y~0=~y~0_In1517541250, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1517541250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1517541250} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1517541250, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1517541250|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1517541250|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1517541250|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In1517541250, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1517541250|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1517541250|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out1517541250|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1517541250|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1517541250, ~y$w_buff1~0=~y$w_buff1~0_In1517541250, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1517541250, ~y$w_buff0~0=~y$w_buff0~0_In1517541250, ~y~0=~y~0_Out1517541250, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1517541250, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1517541250} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 22:58:10,502 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-21 22:58:10,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,503 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-21 22:58:10,503 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [782] [2020-10-21 22:58:10,505 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-21 22:58:10,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,505 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-21 22:58:10,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,505 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-21 22:58:10,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,506 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-21 22:58:10,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,506 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-21 22:58:10,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,506 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-21 22:58:10,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,507 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-21 22:58:10,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,508 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-21 22:58:10,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,508 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-21 22:58:10,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,508 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-21 22:58:10,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,508 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-21 22:58:10,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,509 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-21 22:58:10,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,509 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-21 22:58:10,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,510 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-21 22:58:10,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,510 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-21 22:58:10,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,510 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-21 22:58:10,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,511 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-21 22:58:10,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,512 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-21 22:58:10,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,512 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-21 22:58:10,513 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,513 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-21 22:58:10,513 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,513 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-21 22:58:10,513 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,513 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-21 22:58:10,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,514 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-21 22:58:10,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,514 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-21 22:58:10,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,515 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-21 22:58:10,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,515 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-21 22:58:10,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,516 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-21 22:58:10,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,516 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-21 22:58:10,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,516 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-21 22:58:10,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,517 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-21 22:58:10,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,517 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-21 22:58:10,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:10,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:58:10 BasicIcfg [2020-10-21 22:58:10,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:58:10,638 INFO L168 Benchmark]: Toolchain (without parser) took 18621.47 ms. Allocated memory was 139.5 MB in the beginning and 527.4 MB in the end (delta: 388.0 MB). Free memory was 100.6 MB in the beginning and 58.7 MB in the end (delta: 41.9 MB). Peak memory consumption was 429.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:10,638 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 22:58:10,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.32 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 99.5 MB in the beginning and 151.9 MB in the end (delta: -52.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:10,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.66 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:10,641 INFO L168 Benchmark]: Boogie Preprocessor took 40.34 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 146.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:10,641 INFO L168 Benchmark]: RCFGBuilder took 2186.01 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 146.3 MB in the beginning and 156.4 MB in the end (delta: -10.0 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:10,642 INFO L168 Benchmark]: TraceAbstraction took 15532.65 ms. Allocated memory was 249.0 MB in the beginning and 527.4 MB in the end (delta: 278.4 MB). Free memory was 156.4 MB in the beginning and 58.7 MB in the end (delta: 97.7 MB). Peak memory consumption was 376.1 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:10,649 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.32 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 99.5 MB in the beginning and 151.9 MB in the end (delta: -52.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.66 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.34 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 146.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2186.01 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 146.3 MB in the beginning and 156.4 MB in the end (delta: -10.0 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15532.65 ms. Allocated memory was 249.0 MB in the beginning and 527.4 MB in the end (delta: 278.4 MB). Free memory was 156.4 MB in the beginning and 58.7 MB in the end (delta: 97.7 MB). Peak memory consumption was 376.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1550 VarBasedMoverChecksPositive, 51 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 132 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 129 PlacesBefore, 46 PlacesAfterwards, 119 TransitionsBefore, 33 TransitionsAfterwards, 2862 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, 8274 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t821; [L845] FCALL, FORK 0 pthread_create(&t821, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t822; [L847] FCALL, FORK 0 pthread_create(&t822, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t823; [L849] FCALL, FORK 0 pthread_create(&t823, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "mix030_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 pthread_t t824; [L851] FCALL, FORK 0 pthread_create(&t824, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L769] 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) [L769] 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) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 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 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 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 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L868] 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) [L868] 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) [L869] 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)) [L869] 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) [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L869] 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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L872] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] EXPR 0 !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) [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] EXPR 0 !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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix030_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 666 SDtfs, 984 SDslu, 1041 SDs, 0 SdLazy, 492 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1799 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 52353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...