/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/mix045_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:00:04,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:00:04,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:00:04,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:00:04,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:00:04,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:00:04,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:00:04,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:00:04,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:00:04,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:00:04,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:00:04,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:00:04,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:00:04,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:00:04,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:00:04,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:00:04,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:00:04,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:00:04,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:00:04,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:00:04,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:00:04,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:00:04,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:00:04,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:00:04,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:00:04,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:00:04,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:00:04,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:00:04,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:00:04,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:00:04,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:00:04,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:00:04,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:00:04,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:00:04,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:00:04,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:00:04,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:00:04,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:00:04,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:00:04,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:00:04,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:00:04,755 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 23:00:04,778 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:00:04,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:00:04,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:00:04,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:00:04,780 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:00:04,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:00:04,780 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:00:04,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:00:04,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:00:04,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:00:04,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:00:04,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:00:04,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:00:04,782 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:00:04,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:00:04,782 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:00:04,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:00:04,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:00:04,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:00:04,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:00:04,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:00:04,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:00:04,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:00:04,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:00:04,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:00:04,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:00:04,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:00:04,785 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:00:04,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:00:05,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:00:05,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:00:05,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:00:05,122 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:00:05,122 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:00:05,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2020-10-21 23:00:05,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7f5b005/d22c631a52344c32a5f41ec45068dd1a/FLAG342bc8029 [2020-10-21 23:00:05,769 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:00:05,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2020-10-21 23:00:05,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7f5b005/d22c631a52344c32a5f41ec45068dd1a/FLAG342bc8029 [2020-10-21 23:00:06,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7f5b005/d22c631a52344c32a5f41ec45068dd1a [2020-10-21 23:00:06,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:00:06,064 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:00:06,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:00:06,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:00:06,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:00:06,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f197421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06, skipping insertion in model container [2020-10-21 23:00:06,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:00:06,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:00:06,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:00:06,665 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:00:06,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:00:06,820 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:00:06,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06 WrapperNode [2020-10-21 23:00:06,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:00:06,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:00:06,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:00:06,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:00:06,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:00:06,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:00:06,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:00:06,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:00:06,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (1/1) ... [2020-10-21 23:00:06,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:00:06,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:00:06,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:00:06,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:00:06,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (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 23:00:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:00:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:00:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:00:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:00:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:00:07,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:00:07,030 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:00:07,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:00:07,031 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:00:07,031 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:00:07,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:00:07,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:00:07,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:00:07,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:00:07,037 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 23:00:09,014 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:00:09,014 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:00:09,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:00:09 BoogieIcfgContainer [2020-10-21 23:00:09,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:00:09,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:00:09,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:00:09,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:00:09,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:00:06" (1/3) ... [2020-10-21 23:00:09,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca001b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:00:09, skipping insertion in model container [2020-10-21 23:00:09,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:06" (2/3) ... [2020-10-21 23:00:09,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca001b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:00:09, skipping insertion in model container [2020-10-21 23:00:09,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:00:09" (3/3) ... [2020-10-21 23:00:09,027 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc.i [2020-10-21 23:00:09,041 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:00:09,042 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:00:09,051 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:00:09,052 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:00:09,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,086 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,086 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,088 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,088 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,092 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,092 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,092 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,094 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,112 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:09,114 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:00:09,130 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:00:09,156 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:00:09,157 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:00:09,157 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:00:09,157 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:00:09,157 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:00:09,157 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:00:09,158 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:00:09,158 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:00:09,173 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:00:09,174 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-21 23:00:09,177 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-21 23:00:09,180 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 223 flow [2020-10-21 23:00:09,235 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-10-21 23:00:09,235 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:00:09,240 INFO L80 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-10-21 23:00:09,244 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2020-10-21 23:00:11,188 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-21 23:00:11,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-21 23:00:11,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:00:11,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:00:11,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:00:12,627 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-21 23:00:13,093 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 23:00:14,152 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-21 23:00:14,546 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-10-21 23:00:14,744 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-21 23:00:14,755 INFO L131 LiptonReduction]: Checked pairs total: 5760 [2020-10-21 23:00:14,755 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-10-21 23:00:14,762 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-10-21 23:00:14,827 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1030 states. [2020-10-21 23:00:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states. [2020-10-21 23:00:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 23:00:14,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:14,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:14,839 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:14,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash -141166123, now seen corresponding path program 1 times [2020-10-21 23:00:14,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:14,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816298777] [2020-10-21 23:00:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:15,102 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 23:00:15,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816298777] [2020-10-21 23:00:15,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:15,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:00:15,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44844176] [2020-10-21 23:00:15,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:00:15,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:15,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:00:15,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:00:15,124 INFO L87 Difference]: Start difference. First operand 1030 states. Second operand 3 states. [2020-10-21 23:00:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:15,223 INFO L93 Difference]: Finished difference Result 890 states and 2840 transitions. [2020-10-21 23:00:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:00:15,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 23:00:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:15,256 INFO L225 Difference]: With dead ends: 890 [2020-10-21 23:00:15,257 INFO L226 Difference]: Without dead ends: 650 [2020-10-21 23:00:15,258 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 23:00:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-10-21 23:00:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2020-10-21 23:00:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-10-21 23:00:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2020-10-21 23:00:15,358 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2020-10-21 23:00:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:15,359 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2020-10-21 23:00:15,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:00:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2020-10-21 23:00:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:00:15,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:15,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:15,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:00:15,363 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash -704607506, now seen corresponding path program 1 times [2020-10-21 23:00:15,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:15,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704262171] [2020-10-21 23:00:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:15,572 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 23:00:15,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704262171] [2020-10-21 23:00:15,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:15,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:00:15,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978513126] [2020-10-21 23:00:15,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:15,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:15,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:15,576 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand 4 states. [2020-10-21 23:00:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:15,666 INFO L93 Difference]: Finished difference Result 730 states and 2192 transitions. [2020-10-21 23:00:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:15,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-21 23:00:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:15,673 INFO L225 Difference]: With dead ends: 730 [2020-10-21 23:00:15,674 INFO L226 Difference]: Without dead ends: 610 [2020-10-21 23:00:15,675 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 23:00:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-10-21 23:00:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2020-10-21 23:00:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-10-21 23:00:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1886 transitions. [2020-10-21 23:00:15,702 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1886 transitions. Word has length 10 [2020-10-21 23:00:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:15,702 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 1886 transitions. [2020-10-21 23:00:15,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1886 transitions. [2020-10-21 23:00:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:00:15,705 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:15,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:15,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:00:15,706 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:15,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:15,706 INFO L82 PathProgramCache]: Analyzing trace with hash -368046851, now seen corresponding path program 1 times [2020-10-21 23:00:15,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:15,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671609021] [2020-10-21 23:00:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:15,863 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 23:00:15,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671609021] [2020-10-21 23:00:15,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:15,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:15,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411872860] [2020-10-21 23:00:15,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:15,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:15,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:15,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:15,867 INFO L87 Difference]: Start difference. First operand 610 states and 1886 transitions. Second operand 5 states. [2020-10-21 23:00:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:15,959 INFO L93 Difference]: Finished difference Result 690 states and 2055 transitions. [2020-10-21 23:00:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:15,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-21 23:00:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:15,964 INFO L225 Difference]: With dead ends: 690 [2020-10-21 23:00:15,965 INFO L226 Difference]: Without dead ends: 590 [2020-10-21 23:00:15,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-10-21 23:00:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2020-10-21 23:00:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2020-10-21 23:00:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1810 transitions. [2020-10-21 23:00:15,984 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1810 transitions. Word has length 11 [2020-10-21 23:00:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:15,985 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 1810 transitions. [2020-10-21 23:00:15,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1810 transitions. [2020-10-21 23:00:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:00:15,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:15,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:15,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:00:15,987 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:15,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2009124883, now seen corresponding path program 1 times [2020-10-21 23:00:15,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:15,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889164698] [2020-10-21 23:00:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:16,115 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 23:00:16,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889164698] [2020-10-21 23:00:16,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:16,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:16,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645536562] [2020-10-21 23:00:16,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:16,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:16,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:16,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:16,118 INFO L87 Difference]: Start difference. First operand 590 states and 1810 transitions. Second operand 5 states. [2020-10-21 23:00:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:16,221 INFO L93 Difference]: Finished difference Result 644 states and 1909 transitions. [2020-10-21 23:00:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:16,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 23:00:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:16,226 INFO L225 Difference]: With dead ends: 644 [2020-10-21 23:00:16,226 INFO L226 Difference]: Without dead ends: 554 [2020-10-21 23:00:16,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-10-21 23:00:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2020-10-21 23:00:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-10-21 23:00:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1684 transitions. [2020-10-21 23:00:16,246 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1684 transitions. Word has length 12 [2020-10-21 23:00:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:16,246 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 1684 transitions. [2020-10-21 23:00:16,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1684 transitions. [2020-10-21 23:00:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:00:16,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:16,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:16,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:00:16,248 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:16,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:16,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2143714500, now seen corresponding path program 1 times [2020-10-21 23:00:16,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:16,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861949290] [2020-10-21 23:00:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:16,358 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 23:00:16,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861949290] [2020-10-21 23:00:16,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:16,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:16,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707594094] [2020-10-21 23:00:16,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:16,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:16,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:16,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:16,361 INFO L87 Difference]: Start difference. First operand 554 states and 1684 transitions. Second operand 6 states. [2020-10-21 23:00:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:16,447 INFO L93 Difference]: Finished difference Result 602 states and 1770 transitions. [2020-10-21 23:00:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:16,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:00:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:16,454 INFO L225 Difference]: With dead ends: 602 [2020-10-21 23:00:16,454 INFO L226 Difference]: Without dead ends: 530 [2020-10-21 23:00:16,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-21 23:00:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-21 23:00:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-21 23:00:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1596 transitions. [2020-10-21 23:00:16,476 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1596 transitions. Word has length 13 [2020-10-21 23:00:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:16,477 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1596 transitions. [2020-10-21 23:00:16,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1596 transitions. [2020-10-21 23:00:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:00:16,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:16,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:16,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:00:16,480 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash -851135848, now seen corresponding path program 1 times [2020-10-21 23:00:16,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:16,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754493031] [2020-10-21 23:00:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:16,609 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 23:00:16,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754493031] [2020-10-21 23:00:16,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:16,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:16,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908439063] [2020-10-21 23:00:16,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:16,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:16,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:16,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:16,612 INFO L87 Difference]: Start difference. First operand 530 states and 1596 transitions. Second operand 7 states. [2020-10-21 23:00:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:16,783 INFO L93 Difference]: Finished difference Result 618 states and 1842 transitions. [2020-10-21 23:00:16,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:16,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-21 23:00:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:16,788 INFO L225 Difference]: With dead ends: 618 [2020-10-21 23:00:16,789 INFO L226 Difference]: Without dead ends: 570 [2020-10-21 23:00:16,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-10-21 23:00:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-10-21 23:00:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-10-21 23:00:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1730 transitions. [2020-10-21 23:00:16,811 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1730 transitions. Word has length 14 [2020-10-21 23:00:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:16,811 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 1730 transitions. [2020-10-21 23:00:16,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1730 transitions. [2020-10-21 23:00:16,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:00:16,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:16,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:16,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:00:16,814 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:16,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:16,814 INFO L82 PathProgramCache]: Analyzing trace with hash -847330288, now seen corresponding path program 2 times [2020-10-21 23:00:16,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:16,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951979939] [2020-10-21 23:00:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:16,930 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 23:00:16,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951979939] [2020-10-21 23:00:16,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:16,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:16,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692207816] [2020-10-21 23:00:16,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:16,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:16,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:16,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:16,933 INFO L87 Difference]: Start difference. First operand 570 states and 1730 transitions. Second operand 7 states. [2020-10-21 23:00:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:17,086 INFO L93 Difference]: Finished difference Result 690 states and 2044 transitions. [2020-10-21 23:00:17,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:17,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-21 23:00:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:17,092 INFO L225 Difference]: With dead ends: 690 [2020-10-21 23:00:17,092 INFO L226 Difference]: Without dead ends: 626 [2020-10-21 23:00:17,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-10-21 23:00:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 586. [2020-10-21 23:00:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-10-21 23:00:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1746 transitions. [2020-10-21 23:00:17,112 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1746 transitions. Word has length 14 [2020-10-21 23:00:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:17,112 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 1746 transitions. [2020-10-21 23:00:17,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1746 transitions. [2020-10-21 23:00:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:00:17,114 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:17,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:17,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:00:17,115 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:17,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:17,115 INFO L82 PathProgramCache]: Analyzing trace with hash -615473533, now seen corresponding path program 1 times [2020-10-21 23:00:17,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:17,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190174006] [2020-10-21 23:00:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:17,272 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 23:00:17,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190174006] [2020-10-21 23:00:17,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:17,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:17,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950766883] [2020-10-21 23:00:17,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:17,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:17,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:17,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:17,274 INFO L87 Difference]: Start difference. First operand 586 states and 1746 transitions. Second operand 8 states. [2020-10-21 23:00:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:17,482 INFO L93 Difference]: Finished difference Result 726 states and 2159 transitions. [2020-10-21 23:00:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:17,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:00:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:17,488 INFO L225 Difference]: With dead ends: 726 [2020-10-21 23:00:17,488 INFO L226 Difference]: Without dead ends: 694 [2020-10-21 23:00:17,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:00:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2020-10-21 23:00:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 622. [2020-10-21 23:00:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2020-10-21 23:00:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1869 transitions. [2020-10-21 23:00:17,509 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1869 transitions. Word has length 15 [2020-10-21 23:00:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:17,509 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 1869 transitions. [2020-10-21 23:00:17,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1869 transitions. [2020-10-21 23:00:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:00:17,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:17,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:17,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:00:17,512 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1409204827, now seen corresponding path program 1 times [2020-10-21 23:00:17,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:17,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224831406] [2020-10-21 23:00:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:17,576 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 23:00:17,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224831406] [2020-10-21 23:00:17,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:17,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:17,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317436151] [2020-10-21 23:00:17,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:17,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:17,578 INFO L87 Difference]: Start difference. First operand 622 states and 1869 transitions. Second operand 4 states. [2020-10-21 23:00:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:17,613 INFO L93 Difference]: Finished difference Result 590 states and 1568 transitions. [2020-10-21 23:00:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:17,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-21 23:00:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:17,616 INFO L225 Difference]: With dead ends: 590 [2020-10-21 23:00:17,617 INFO L226 Difference]: Without dead ends: 434 [2020-10-21 23:00:17,617 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 23:00:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-21 23:00:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-21 23:00:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-21 23:00:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1117 transitions. [2020-10-21 23:00:17,630 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1117 transitions. Word has length 15 [2020-10-21 23:00:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:17,630 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1117 transitions. [2020-10-21 23:00:17,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1117 transitions. [2020-10-21 23:00:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:00:17,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:17,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:17,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:00:17,632 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1081553627, now seen corresponding path program 1 times [2020-10-21 23:00:17,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:17,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590117501] [2020-10-21 23:00:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:17,697 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 23:00:17,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590117501] [2020-10-21 23:00:17,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:17,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:17,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139661676] [2020-10-21 23:00:17,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:17,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:17,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:17,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:17,699 INFO L87 Difference]: Start difference. First operand 434 states and 1117 transitions. Second operand 5 states. [2020-10-21 23:00:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:17,744 INFO L93 Difference]: Finished difference Result 338 states and 796 transitions. [2020-10-21 23:00:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:17,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 23:00:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:17,747 INFO L225 Difference]: With dead ends: 338 [2020-10-21 23:00:17,747 INFO L226 Difference]: Without dead ends: 260 [2020-10-21 23:00:17,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:17,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-10-21 23:00:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2020-10-21 23:00:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-10-21 23:00:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 595 transitions. [2020-10-21 23:00:17,755 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 595 transitions. Word has length 16 [2020-10-21 23:00:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:17,756 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 595 transitions. [2020-10-21 23:00:17,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 595 transitions. [2020-10-21 23:00:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:00:17,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:17,757 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 23:00:17,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:00:17,758 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:17,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:17,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1337391238, now seen corresponding path program 1 times [2020-10-21 23:00:17,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:17,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716585235] [2020-10-21 23:00:17,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:17,856 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 23:00:17,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716585235] [2020-10-21 23:00:17,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:17,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:17,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187252048] [2020-10-21 23:00:17,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:17,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:17,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:17,858 INFO L87 Difference]: Start difference. First operand 260 states and 595 transitions. Second operand 7 states. [2020-10-21 23:00:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:17,948 INFO L93 Difference]: Finished difference Result 407 states and 910 transitions. [2020-10-21 23:00:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:17,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-21 23:00:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:17,950 INFO L225 Difference]: With dead ends: 407 [2020-10-21 23:00:17,950 INFO L226 Difference]: Without dead ends: 273 [2020-10-21 23:00:17,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-10-21 23:00:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2020-10-21 23:00:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-10-21 23:00:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 576 transitions. [2020-10-21 23:00:17,959 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 576 transitions. Word has length 18 [2020-10-21 23:00:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:17,959 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 576 transitions. [2020-10-21 23:00:17,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 576 transitions. [2020-10-21 23:00:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:00:17,960 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:17,960 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 23:00:17,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:00:17,961 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:17,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1982407278, now seen corresponding path program 2 times [2020-10-21 23:00:17,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:17,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170421034] [2020-10-21 23:00:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:18,044 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 23:00:18,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170421034] [2020-10-21 23:00:18,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:18,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:18,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665330160] [2020-10-21 23:00:18,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:18,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:18,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:18,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:18,046 INFO L87 Difference]: Start difference. First operand 265 states and 576 transitions. Second operand 6 states. [2020-10-21 23:00:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:18,107 INFO L93 Difference]: Finished difference Result 364 states and 756 transitions. [2020-10-21 23:00:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:18,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-21 23:00:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:18,109 INFO L225 Difference]: With dead ends: 364 [2020-10-21 23:00:18,110 INFO L226 Difference]: Without dead ends: 232 [2020-10-21 23:00:18,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-10-21 23:00:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2020-10-21 23:00:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-21 23:00:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 419 transitions. [2020-10-21 23:00:18,116 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 419 transitions. Word has length 18 [2020-10-21 23:00:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:18,117 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 419 transitions. [2020-10-21 23:00:18,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 419 transitions. [2020-10-21 23:00:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:00:18,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:18,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:18,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:00:18,118 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2040034504, now seen corresponding path program 1 times [2020-10-21 23:00:18,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:18,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634347365] [2020-10-21 23:00:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:18,323 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 23:00:18,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634347365] [2020-10-21 23:00:18,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:18,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:18,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443728728] [2020-10-21 23:00:18,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:18,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:18,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:18,325 INFO L87 Difference]: Start difference. First operand 210 states and 419 transitions. Second operand 8 states. [2020-10-21 23:00:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:18,469 INFO L93 Difference]: Finished difference Result 228 states and 455 transitions. [2020-10-21 23:00:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:18,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-21 23:00:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:18,471 INFO L225 Difference]: With dead ends: 228 [2020-10-21 23:00:18,471 INFO L226 Difference]: Without dead ends: 177 [2020-10-21 23:00:18,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:00:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-21 23:00:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2020-10-21 23:00:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-10-21 23:00:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 320 transitions. [2020-10-21 23:00:18,477 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 320 transitions. Word has length 19 [2020-10-21 23:00:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:18,477 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 320 transitions. [2020-10-21 23:00:18,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 320 transitions. [2020-10-21 23:00:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:00:18,478 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:18,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:18,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:00:18,479 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:18,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1155310386, now seen corresponding path program 1 times [2020-10-21 23:00:18,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:18,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960484095] [2020-10-21 23:00:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:18,557 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 23:00:18,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960484095] [2020-10-21 23:00:18,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:18,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:18,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534360836] [2020-10-21 23:00:18,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:18,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:18,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:18,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:18,560 INFO L87 Difference]: Start difference. First operand 159 states and 320 transitions. Second operand 6 states. [2020-10-21 23:00:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:18,606 INFO L93 Difference]: Finished difference Result 135 states and 271 transitions. [2020-10-21 23:00:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:18,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-21 23:00:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:18,608 INFO L225 Difference]: With dead ends: 135 [2020-10-21 23:00:18,608 INFO L226 Difference]: Without dead ends: 71 [2020-10-21 23:00:18,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-21 23:00:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-21 23:00:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-21 23:00:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2020-10-21 23:00:18,611 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 19 [2020-10-21 23:00:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:18,611 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2020-10-21 23:00:18,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2020-10-21 23:00:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:00:18,612 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:18,612 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] [2020-10-21 23:00:18,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:00:18,613 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:18,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash -458675981, now seen corresponding path program 1 times [2020-10-21 23:00:18,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:18,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166340828] [2020-10-21 23:00:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:18,763 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 23:00:18,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166340828] [2020-10-21 23:00:18,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:18,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:18,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668777116] [2020-10-21 23:00:18,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:18,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:18,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:18,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:18,765 INFO L87 Difference]: Start difference. First operand 71 states and 134 transitions. Second operand 8 states. [2020-10-21 23:00:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:18,872 INFO L93 Difference]: Finished difference Result 86 states and 157 transitions. [2020-10-21 23:00:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:18,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-21 23:00:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:18,873 INFO L225 Difference]: With dead ends: 86 [2020-10-21 23:00:18,873 INFO L226 Difference]: Without dead ends: 59 [2020-10-21 23:00:18,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-21 23:00:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-21 23:00:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-21 23:00:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2020-10-21 23:00:18,877 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 22 [2020-10-21 23:00:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:18,877 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2020-10-21 23:00:18,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2020-10-21 23:00:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:00:18,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:18,878 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] [2020-10-21 23:00:18,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:00:18,879 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash 234475549, now seen corresponding path program 2 times [2020-10-21 23:00:18,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:18,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248840820] [2020-10-21 23:00:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:19,039 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 23:00:19,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248840820] [2020-10-21 23:00:19,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:19,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:19,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166755029] [2020-10-21 23:00:19,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:19,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:19,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:19,041 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand 8 states. [2020-10-21 23:00:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:19,133 INFO L93 Difference]: Finished difference Result 85 states and 149 transitions. [2020-10-21 23:00:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:00:19,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-21 23:00:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:19,135 INFO L225 Difference]: With dead ends: 85 [2020-10-21 23:00:19,135 INFO L226 Difference]: Without dead ends: 59 [2020-10-21 23:00:19,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:00:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-21 23:00:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-21 23:00:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-21 23:00:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 99 transitions. [2020-10-21 23:00:19,138 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 99 transitions. Word has length 22 [2020-10-21 23:00:19,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:19,139 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 99 transitions. [2020-10-21 23:00:19,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 99 transitions. [2020-10-21 23:00:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:00:19,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:19,140 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] [2020-10-21 23:00:19,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:00:19,140 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:19,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:19,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1075598141, now seen corresponding path program 3 times [2020-10-21 23:00:19,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:19,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959161411] [2020-10-21 23:00:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:19,369 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 23:00:19,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959161411] [2020-10-21 23:00:19,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:19,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:00:19,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97908560] [2020-10-21 23:00:19,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:00:19,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:19,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:00:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:00:19,371 INFO L87 Difference]: Start difference. First operand 59 states and 99 transitions. Second operand 10 states. [2020-10-21 23:00:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:19,538 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions. [2020-10-21 23:00:19,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:00:19,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-21 23:00:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:19,539 INFO L225 Difference]: With dead ends: 74 [2020-10-21 23:00:19,539 INFO L226 Difference]: Without dead ends: 37 [2020-10-21 23:00:19,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:00:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-21 23:00:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-21 23:00:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-21 23:00:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2020-10-21 23:00:19,541 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 22 [2020-10-21 23:00:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:19,542 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2020-10-21 23:00:19,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:00:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2020-10-21 23:00:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:00:19,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:19,542 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] [2020-10-21 23:00:19,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:00:19,543 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:19,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1615855003, now seen corresponding path program 4 times [2020-10-21 23:00:19,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:19,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115503746] [2020-10-21 23:00:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:00:19,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:00:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:00:19,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:00:19,645 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:00:19,646 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:00:19,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:00:19,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,675 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [779] [2020-10-21 23:00:19,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:19,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,684 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 23:00:19,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,684 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 23:00:19,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,685 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 23:00:19,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,686 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 23:00:19,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,686 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 23:00:19,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,686 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 23:00:19,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,687 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 23:00:19,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,687 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 23:00:19,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,688 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 23:00:19,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,688 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 23:00:19,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,688 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 23:00:19,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,689 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 23:00:19,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,689 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 23:00:19,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,689 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 23:00:19,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:19,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:00:19 BasicIcfg [2020-10-21 23:00:19,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:00:19,763 INFO L168 Benchmark]: Toolchain (without parser) took 13705.94 ms. Allocated memory was 138.9 MB in the beginning and 373.3 MB in the end (delta: 234.4 MB). Free memory was 99.6 MB in the beginning and 203.7 MB in the end (delta: -104.1 MB). Peak memory consumption was 130.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:19,764 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 23:00:19,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.67 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 98.6 MB in the beginning and 153.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:19,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.15 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:19,769 INFO L168 Benchmark]: Boogie Preprocessor took 54.58 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:19,769 INFO L168 Benchmark]: RCFGBuilder took 2069.41 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 147.8 MB in the beginning and 189.8 MB in the end (delta: -42.0 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:19,770 INFO L168 Benchmark]: TraceAbstraction took 10742.73 ms. Allocated memory was 249.0 MB in the beginning and 373.3 MB in the end (delta: 124.3 MB). Free memory was 189.8 MB in the beginning and 203.7 MB in the end (delta: -14.0 MB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:19,775 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.25 ms. Allocated memory is still 138.9 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.67 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 98.6 MB in the beginning and 153.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.15 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.58 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2069.41 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 147.8 MB in the beginning and 189.8 MB in the end (delta: -42.0 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10742.73 ms. Allocated memory was 249.0 MB in the beginning and 373.3 MB in the end (delta: 124.3 MB). Free memory was 189.8 MB in the beginning and 203.7 MB in the end (delta: -14.0 MB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1040 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 96 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.5s, 111 PlacesBefore, 38 PlacesAfterwards, 104 TransitionsBefore, 29 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 5760 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1211; [L824] FCALL, FORK 0 pthread_create(&t1211, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L825] 0 pthread_t t1212; [L826] FCALL, FORK 0 pthread_create(&t1212, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L827] 0 pthread_t t1213; [L828] FCALL, FORK 0 pthread_create(&t1213, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L763] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L766] 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) [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L845] 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) [L845] 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) [L846] 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)) [L846] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix045_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 507 SDtfs, 637 SDslu, 1140 SDs, 0 SdLazy, 544 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1030occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 160 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 37213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...