/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/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:11:35,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:11:35,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:11:35,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:11:35,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:11:35,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:11:35,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:11:35,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:11:35,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:11:35,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:11:35,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:11:35,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:11:35,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:11:35,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:11:35,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:11:35,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:11:35,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:11:35,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:11:35,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:11:35,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:11:35,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:11:35,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:11:35,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:11:35,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:11:35,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:11:35,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:11:35,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:11:35,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:11:35,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:11:35,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:11:35,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:11:35,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:11:35,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:11:35,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:11:35,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:11:35,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:11:35,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:11:35,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:11:35,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:11:35,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:11:35,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:11:35,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:11:35,782 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:11:35,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:11:35,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:11:35,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:11:35,784 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:11:35,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:11:35,785 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:11:35,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:11:35,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:11:35,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:11:35,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:11:35,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:11:35,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:11:35,786 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:11:35,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:11:35,786 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:11:35,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:11:35,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:11:35,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:11:35,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:11:35,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:11:35,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:35,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:11:35,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:11:35,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:11:35,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:11:35,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:11:35,789 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:11:35,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:11:36,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:11:36,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:11:36,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:11:36,138 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:11:36,139 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:11:36,139 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2020-10-16 12:11:36,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9d94c6079/756e0029a9af487ab02ab0cf6f48dc71/FLAG7ea379935 [2020-10-16 12:11:36,777 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:11:36,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2020-10-16 12:11:36,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9d94c6079/756e0029a9af487ab02ab0cf6f48dc71/FLAG7ea379935 [2020-10-16 12:11:37,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9d94c6079/756e0029a9af487ab02ab0cf6f48dc71 [2020-10-16 12:11:37,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:11:37,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:11:37,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:37,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:11:37,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:11:37,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4618a95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37, skipping insertion in model container [2020-10-16 12:11:37,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:11:37,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:11:37,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:37,656 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:11:37,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:37,854 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:11:37,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37 WrapperNode [2020-10-16 12:11:37,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:37,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:37,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:11:37,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:11:37,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:37,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:11:37,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:11:37,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:11:37,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... [2020-10-16 12:11:37,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:11:37,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:11:37,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:11:37,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:11:37,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 12:11:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:11:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:11:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:11:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:11:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:11:38,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:11:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:11:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:11:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:11:38,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:11:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:11:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:11:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:11:38,083 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:11:40,037 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:11:40,038 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:11:40,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:40 BoogieIcfgContainer [2020-10-16 12:11:40,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:11:40,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:11:40,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:11:40,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:11:40,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:11:37" (1/3) ... [2020-10-16 12:11:40,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f290fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:40, skipping insertion in model container [2020-10-16 12:11:40,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:37" (2/3) ... [2020-10-16 12:11:40,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f290fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:40, skipping insertion in model container [2020-10-16 12:11:40,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:40" (3/3) ... [2020-10-16 12:11:40,050 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2020-10-16 12:11:40,063 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:11:40,063 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:11:40,072 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:11:40,073 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:11:40,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,102 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,103 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,122 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,123 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,123 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,126 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,126 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:40,128 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:11:40,142 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:11:40,164 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:11:40,165 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:11:40,165 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:11:40,165 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:11:40,165 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:11:40,165 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:11:40,166 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:11:40,166 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:11:40,183 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:11:40,183 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 12:11:40,187 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 12:11:40,190 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 12:11:40,243 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 12:11:40,244 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:11:40,249 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 12:11:40,253 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 12:11:40,685 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:11:40,816 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:11:42,065 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 12:11:42,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 12:11:42,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:42,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:11:42,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:42,881 WARN L193 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 12:11:43,120 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 12:11:43,540 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:11:45,119 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-16 12:11:45,416 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-16 12:11:45,857 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-16 12:11:46,247 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-16 12:11:46,952 WARN L193 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-16 12:11:47,283 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 12:11:48,310 WARN L193 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 128 [2020-10-16 12:11:48,664 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:11:48,896 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:11:49,005 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:11:49,013 INFO L132 LiptonReduction]: Checked pairs total: 4144 [2020-10-16 12:11:49,013 INFO L134 LiptonReduction]: Total number of compositions: 79 [2020-10-16 12:11:49,021 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 12:11:49,071 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-16 12:11:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-16 12:11:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:11:49,081 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:49,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:49,083 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-16 12:11:49,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1019465781, now seen corresponding path program 1 times [2020-10-16 12:11:49,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:49,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007328690] [2020-10-16 12:11:49,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:49,340 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-16 12:11:49,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007328690] [2020-10-16 12:11:49,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:49,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:49,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963949491] [2020-10-16 12:11:49,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:49,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:49,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:49,367 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-16 12:11:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:49,503 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-16 12:11:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:49,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:11:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:49,537 INFO L225 Difference]: With dead ends: 550 [2020-10-16 12:11:49,538 INFO L226 Difference]: Without dead ends: 450 [2020-10-16 12:11:49,539 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-16 12:11:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-16 12:11:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-16 12:11:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 12:11:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-16 12:11:49,647 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-16 12:11:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:49,649 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-16 12:11:49,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-16 12:11:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:11:49,651 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:49,651 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:49,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:11:49,652 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-16 12:11:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash 454120523, now seen corresponding path program 1 times [2020-10-16 12:11:49,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:49,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437426375] [2020-10-16 12:11:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:49,762 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-16 12:11:49,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437426375] [2020-10-16 12:11:49,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:49,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:49,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128399207] [2020-10-16 12:11:49,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:49,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:49,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:49,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:49,770 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-16 12:11:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:49,791 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-16 12:11:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:49,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:11:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:49,797 INFO L225 Difference]: With dead ends: 440 [2020-10-16 12:11:49,797 INFO L226 Difference]: Without dead ends: 440 [2020-10-16 12:11:49,798 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-16 12:11:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-16 12:11:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-16 12:11:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 12:11:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-16 12:11:49,823 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-16 12:11:49,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:49,824 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-16 12:11:49,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-16 12:11:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:11:49,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:49,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:49,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:11:49,826 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-16 12:11:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash 660752975, now seen corresponding path program 1 times [2020-10-16 12:11:49,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:49,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857385778] [2020-10-16 12:11:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:49,979 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-16 12:11:49,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857385778] [2020-10-16 12:11:49,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:49,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:49,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819316676] [2020-10-16 12:11:49,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:49,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:49,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:49,982 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-16 12:11:50,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:50,010 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-16 12:11:50,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:50,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:11:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:50,016 INFO L225 Difference]: With dead ends: 434 [2020-10-16 12:11:50,016 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 12:11:50,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 12:11:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-16 12:11:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-16 12:11:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-16 12:11:50,035 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-16 12:11:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:50,036 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-16 12:11:50,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-16 12:11:50,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:11:50,038 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:50,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:50,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:11:50,039 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-16 12:11:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash -991494548, now seen corresponding path program 1 times [2020-10-16 12:11:50,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:50,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993011641] [2020-10-16 12:11:50,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:50,193 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-16 12:11:50,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993011641] [2020-10-16 12:11:50,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:50,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:50,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987683148] [2020-10-16 12:11:50,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:50,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:50,196 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 5 states. [2020-10-16 12:11:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:50,293 INFO L93 Difference]: Finished difference Result 420 states and 1246 transitions. [2020-10-16 12:11:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:50,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 12:11:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:50,298 INFO L225 Difference]: With dead ends: 420 [2020-10-16 12:11:50,298 INFO L226 Difference]: Without dead ends: 420 [2020-10-16 12:11:50,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-10-16 12:11:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-10-16 12:11:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-16 12:11:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1246 transitions. [2020-10-16 12:11:50,315 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1246 transitions. Word has length 11 [2020-10-16 12:11:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:50,315 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1246 transitions. [2020-10-16 12:11:50,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1246 transitions. [2020-10-16 12:11:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:11:50,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:50,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:50,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:11:50,322 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-16 12:11:50,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash 350943551, now seen corresponding path program 1 times [2020-10-16 12:11:50,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:50,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112920558] [2020-10-16 12:11:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:50,423 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-16 12:11:50,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112920558] [2020-10-16 12:11:50,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:50,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:50,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60041183] [2020-10-16 12:11:50,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:50,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:50,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:50,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:50,427 INFO L87 Difference]: Start difference. First operand 420 states and 1246 transitions. Second operand 5 states. [2020-10-16 12:11:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:50,484 INFO L93 Difference]: Finished difference Result 415 states and 1227 transitions. [2020-10-16 12:11:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:50,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:11:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:50,489 INFO L225 Difference]: With dead ends: 415 [2020-10-16 12:11:50,489 INFO L226 Difference]: Without dead ends: 415 [2020-10-16 12:11:50,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-10-16 12:11:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2020-10-16 12:11:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2020-10-16 12:11:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1216 transitions. [2020-10-16 12:11:50,504 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1216 transitions. Word has length 12 [2020-10-16 12:11:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:50,505 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 1216 transitions. [2020-10-16 12:11:50,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1216 transitions. [2020-10-16 12:11:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:11:50,506 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:50,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:50,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:11:50,507 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-16 12:11:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:50,507 INFO L82 PathProgramCache]: Analyzing trace with hash -442809329, now seen corresponding path program 1 times [2020-10-16 12:11:50,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:50,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826250684] [2020-10-16 12:11:50,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:50,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-16 12:11:50,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826250684] [2020-10-16 12:11:50,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:50,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:11:50,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912809663] [2020-10-16 12:11:50,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:50,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:50,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:50,560 INFO L87 Difference]: Start difference. First operand 411 states and 1216 transitions. Second operand 3 states. [2020-10-16 12:11:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:50,574 INFO L93 Difference]: Finished difference Result 560 states and 1604 transitions. [2020-10-16 12:11:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:50,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:11:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:50,579 INFO L225 Difference]: With dead ends: 560 [2020-10-16 12:11:50,579 INFO L226 Difference]: Without dead ends: 425 [2020-10-16 12:11:50,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2020-10-16 12:11:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 398. [2020-10-16 12:11:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-16 12:11:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-10-16 12:11:50,594 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-10-16 12:11:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:50,594 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-10-16 12:11:50,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-10-16 12:11:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:11:50,596 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:50,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:50,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:11:50,596 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-16 12:11:50,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2005652100, now seen corresponding path program 1 times [2020-10-16 12:11:50,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:50,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345680194] [2020-10-16 12:11:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:50,702 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-16 12:11:50,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345680194] [2020-10-16 12:11:50,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:50,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:50,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454274516] [2020-10-16 12:11:50,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:50,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:50,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:50,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:50,704 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 6 states. [2020-10-16 12:11:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:50,814 INFO L93 Difference]: Finished difference Result 440 states and 1227 transitions. [2020-10-16 12:11:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:50,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 12:11:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:50,818 INFO L225 Difference]: With dead ends: 440 [2020-10-16 12:11:50,819 INFO L226 Difference]: Without dead ends: 392 [2020-10-16 12:11:50,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:11:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-10-16 12:11:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-10-16 12:11:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-10-16 12:11:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1086 transitions. [2020-10-16 12:11:50,833 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1086 transitions. Word has length 13 [2020-10-16 12:11:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:50,834 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 1086 transitions. [2020-10-16 12:11:50,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1086 transitions. [2020-10-16 12:11:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:11:50,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:50,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:50,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:11:50,836 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-16 12:11:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash -842166617, now seen corresponding path program 1 times [2020-10-16 12:11:50,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:50,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115529706] [2020-10-16 12:11:50,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:50,918 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-16 12:11:50,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115529706] [2020-10-16 12:11:50,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:50,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:50,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438152883] [2020-10-16 12:11:50,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:11:50,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:50,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:11:50,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:50,920 INFO L87 Difference]: Start difference. First operand 392 states and 1086 transitions. Second operand 4 states. [2020-10-16 12:11:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:50,975 INFO L93 Difference]: Finished difference Result 384 states and 935 transitions. [2020-10-16 12:11:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:50,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:11:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:50,978 INFO L225 Difference]: With dead ends: 384 [2020-10-16 12:11:50,978 INFO L226 Difference]: Without dead ends: 280 [2020-10-16 12:11:50,979 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-16 12:11:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-10-16 12:11:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-10-16 12:11:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-16 12:11:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 662 transitions. [2020-10-16 12:11:50,988 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 662 transitions. Word has length 13 [2020-10-16 12:11:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:50,988 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 662 transitions. [2020-10-16 12:11:50,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:11:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 662 transitions. [2020-10-16 12:11:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:11:50,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:50,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:50,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:11:50,990 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-16 12:11:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash -711911559, now seen corresponding path program 1 times [2020-10-16 12:11:50,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:50,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88080758] [2020-10-16 12:11:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:51,120 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-16 12:11:51,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88080758] [2020-10-16 12:11:51,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:51,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:51,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398784691] [2020-10-16 12:11:51,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:51,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:51,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:51,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:51,123 INFO L87 Difference]: Start difference. First operand 280 states and 662 transitions. Second operand 5 states. [2020-10-16 12:11:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:51,173 INFO L93 Difference]: Finished difference Result 230 states and 495 transitions. [2020-10-16 12:11:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:11:51,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:11:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:51,176 INFO L225 Difference]: With dead ends: 230 [2020-10-16 12:11:51,176 INFO L226 Difference]: Without dead ends: 176 [2020-10-16 12:11:51,176 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-16 12:11:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-16 12:11:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-16 12:11:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-16 12:11:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 368 transitions. [2020-10-16 12:11:51,182 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 368 transitions. Word has length 14 [2020-10-16 12:11:51,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:51,183 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 368 transitions. [2020-10-16 12:11:51,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 368 transitions. [2020-10-16 12:11:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:11:51,184 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:51,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:51,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:11:51,184 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-16 12:11:51,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:51,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1312231858, now seen corresponding path program 1 times [2020-10-16 12:11:51,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:51,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753519100] [2020-10-16 12:11:51,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:51,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753519100] [2020-10-16 12:11:51,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:51,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:11:51,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210976462] [2020-10-16 12:11:51,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:51,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:51,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:51,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:51,298 INFO L87 Difference]: Start difference. First operand 176 states and 368 transitions. Second operand 6 states. [2020-10-16 12:11:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:51,371 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-10-16 12:11:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:11:51,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:11:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:51,373 INFO L225 Difference]: With dead ends: 157 [2020-10-16 12:11:51,373 INFO L226 Difference]: Without dead ends: 97 [2020-10-16 12:11:51,374 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-16 12:11:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-16 12:11:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-10-16 12:11:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-16 12:11:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-10-16 12:11:51,378 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-10-16 12:11:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:51,379 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-10-16 12:11:51,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-10-16 12:11:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:11:51,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:51,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:51,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:11:51,380 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-16 12:11:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1503762436, now seen corresponding path program 1 times [2020-10-16 12:11:51,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:51,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194992841] [2020-10-16 12:11:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:51,470 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-16 12:11:51,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194992841] [2020-10-16 12:11:51,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:51,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:51,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103458520] [2020-10-16 12:11:51,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:11:51,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:51,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:11:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:51,473 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 4 states. [2020-10-16 12:11:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:51,492 INFO L93 Difference]: Finished difference Result 113 states and 224 transitions. [2020-10-16 12:11:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:51,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-16 12:11:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:51,495 INFO L225 Difference]: With dead ends: 113 [2020-10-16 12:11:51,495 INFO L226 Difference]: Without dead ends: 47 [2020-10-16 12:11:51,495 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-16 12:11:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-16 12:11:51,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-16 12:11:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-16 12:11:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-16 12:11:51,497 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-10-16 12:11:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:51,498 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-16 12:11:51,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:11:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-16 12:11:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:11:51,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:51,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:51,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:11:51,501 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-16 12:11:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1669447360, now seen corresponding path program 2 times [2020-10-16 12:11:51,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:51,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464724692] [2020-10-16 12:11:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:51,688 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-16 12:11:51,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464724692] [2020-10-16 12:11:51,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:51,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:51,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304128860] [2020-10-16 12:11:51,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:51,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:51,691 INFO L87 Difference]: Start difference. First operand 47 states and 80 transitions. Second operand 6 states. [2020-10-16 12:11:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:51,801 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2020-10-16 12:11:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:11:51,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 12:11:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:51,803 INFO L225 Difference]: With dead ends: 61 [2020-10-16 12:11:51,803 INFO L226 Difference]: Without dead ends: 35 [2020-10-16 12:11:51,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-16 12:11:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-16 12:11:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-16 12:11:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-16 12:11:51,806 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 20 [2020-10-16 12:11:51,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:51,809 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-16 12:11:51,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-16 12:11:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:11:51,811 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:51,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:51,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:11:51,812 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-16 12:11:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:51,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1311498048, now seen corresponding path program 3 times [2020-10-16 12:11:51,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:51,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934282806] [2020-10-16 12:11:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:11:51,860 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:11:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:11:51,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:11:51,965 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:11:51,966 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:11:51,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:11:51,967 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:11:51,981 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L813-->L820: Formula: (let ((.cse9 (= (mod ~y$w_buff1_used~0_In148580819 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In148580819 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In148580819 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In148580819 256) 0))) (let ((.cse1 (not .cse7)) (.cse2 (not .cse6)) (.cse3 (not .cse8)) (.cse4 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse0 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In148580819| ULTIMATE.start_assume_abort_if_not_~cond_Out148580819) (or (and (= ~y$w_buff0_used~0_In148580819 ~y$w_buff0_used~0_Out148580819) .cse0) (and .cse1 (= ~y$w_buff0_used~0_Out148580819 0) .cse2)) (= ~y$r_buff1_thd0~0_Out148580819 ~y$r_buff1_thd0~0_In148580819) (= ~y$r_buff0_thd0~0_Out148580819 ~y$r_buff0_thd0~0_In148580819) (or (and (= ~y$w_buff1_used~0_Out148580819 0) .cse3 .cse4) (and .cse5 (= ~y$w_buff1_used~0_In148580819 ~y$w_buff1_used~0_Out148580819))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out148580819 0)) (or (and .cse1 .cse2 (= ~y$w_buff0~0_In148580819 ~y~0_Out148580819)) (and (or (and (= ~y~0_Out148580819 ~y$w_buff1~0_In148580819) .cse3 .cse4) (and (= ~y~0_Out148580819 ~y~0_In148580819) .cse5)) .cse0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In148580819|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In148580819, ~y$w_buff1~0=~y$w_buff1~0_In148580819, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In148580819, ~y$w_buff0~0=~y$w_buff0~0_In148580819, ~y~0=~y~0_In148580819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In148580819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In148580819} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out148580819, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out148580819|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out148580819|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out148580819|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out148580819|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out148580819|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out148580819|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In148580819|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out148580819, ~y$w_buff1~0=~y$w_buff1~0_In148580819, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out148580819, ~y$w_buff0~0=~y$w_buff0~0_In148580819, ~y~0=~y~0_Out148580819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out148580819, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out148580819} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:11:51,992 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-16 12:11:51,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:51,994 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-16 12:11:51,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:51,995 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-16 12:11:51,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:51,996 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-16 12:11:51,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:51,996 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-16 12:11:51,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:51,997 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-16 12:11:51,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:51,998 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-16 12:11:51,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:51,998 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-16 12:11:51,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:51,999 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-16 12:11:51,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:51,999 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-16 12:11:51,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,000 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-16 12:11:52,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,000 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-16 12:11:52,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,001 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-16 12:11:52,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,002 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-16 12:11:52,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,002 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-16 12:11:52,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,002 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-16 12:11:52,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,003 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-16 12:11:52,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,003 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-16 12:11:52,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,009 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-16 12:11:52,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,009 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-16 12:11:52,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,010 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-16 12:11:52,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,011 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-16 12:11:52,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,011 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-16 12:11:52,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:52,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:11:52 BasicIcfg [2020-10-16 12:11:52,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:11:52,107 INFO L168 Benchmark]: Toolchain (without parser) took 15013.55 ms. Allocated memory was 139.5 MB in the beginning and 390.6 MB in the end (delta: 251.1 MB). Free memory was 101.1 MB in the beginning and 110.6 MB in the end (delta: -9.5 MB). Peak memory consumption was 241.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:52,108 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:11:52,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.11 ms. Allocated memory was 139.5 MB in the beginning and 226.5 MB in the end (delta: 87.0 MB). Free memory was 100.7 MB in the beginning and 189.8 MB in the end (delta: -89.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:52,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.21 ms. Allocated memory is still 226.5 MB. Free memory was 189.8 MB in the beginning and 187.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:52,114 INFO L168 Benchmark]: Boogie Preprocessor took 50.90 ms. Allocated memory is still 226.5 MB. Free memory was 187.0 MB in the beginning and 184.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:52,115 INFO L168 Benchmark]: RCFGBuilder took 2061.90 ms. Allocated memory was 226.5 MB in the beginning and 253.2 MB in the end (delta: 26.7 MB). Free memory was 184.2 MB in the beginning and 113.4 MB in the end (delta: 70.9 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:52,121 INFO L168 Benchmark]: TraceAbstraction took 12062.39 ms. Allocated memory was 253.2 MB in the beginning and 390.6 MB in the end (delta: 137.4 MB). Free memory was 113.4 MB in the beginning and 110.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 140.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:52,124 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.11 ms. Allocated memory was 139.5 MB in the beginning and 226.5 MB in the end (delta: 87.0 MB). Free memory was 100.7 MB in the beginning and 189.8 MB in the end (delta: -89.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.21 ms. Allocated memory is still 226.5 MB. Free memory was 189.8 MB in the beginning and 187.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.90 ms. Allocated memory is still 226.5 MB. Free memory was 187.0 MB in the beginning and 184.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2061.90 ms. Allocated memory was 226.5 MB in the beginning and 253.2 MB in the end (delta: 26.7 MB). Free memory was 184.2 MB in the beginning and 113.4 MB in the end (delta: 70.9 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12062.39 ms. Allocated memory was 253.2 MB in the beginning and 390.6 MB in the end (delta: 137.4 MB). Free memory was 113.4 MB in the beginning and 110.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 140.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 798 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 70 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.8s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 4144 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L804] 0 pthread_t t2528; [L805] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L806] 0 pthread_t t2529; [L807] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L808] 0 pthread_t t2530; [L809] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L767] 3 y$w_buff1 = y$w_buff0 [L768] 3 y$w_buff0 = 2 [L769] 3 y$w_buff1_used = y$w_buff0_used [L770] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L772] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L776] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L730] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2] [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2] [L747] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2] [L750] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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=2] [L753] 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) [L753] 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) [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 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 [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L756] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 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 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L782] 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) [L782] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L782] 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) [L782] 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) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L783] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L784] 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 [L785] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L786] 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 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L811] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 y$flush_delayed = weak$$choice2 [L825] 0 y$mem_tmp = y [L826] 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) [L826] 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) [L827] 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)) [L827] 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) [L827] 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)) [L827] 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)) [L828] 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)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L828] 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)) [L828] 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)) [L829] 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)) [L829] 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)) [L830] 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)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] 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)) [L830] 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)) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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)) [L833] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L834] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L834] 0 y = y$flush_delayed ? y$mem_tmp : y [L835] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 265 SDtfs, 274 SDslu, 327 SDs, 0 SdLazy, 181 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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, 12 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 11849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...