/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/safe008_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:38:47,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:38:47,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:38:47,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:38:47,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:38:47,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:38:47,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:38:47,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:38:47,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:38:47,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:38:47,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:38:47,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:38:47,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:38:47,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:38:47,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:38:47,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:38:47,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:38:47,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:38:47,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:38:47,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:38:47,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:38:47,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:38:47,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:38:47,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:38:47,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:38:47,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:38:47,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:38:47,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:38:47,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:38:47,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:38:47,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:38:47,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:38:47,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:38:47,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:38:47,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:38:47,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:38:47,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:38:47,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:38:47,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:38:47,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:38:47,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:38:47,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:38:47,824 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:38:47,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:38:47,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:38:47,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:38:47,826 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:38:47,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:38:47,827 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:38:47,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:38:47,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:38:47,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:38:47,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:38:47,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:38:47,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:38:47,829 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:38:47,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:38:47,830 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:38:47,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:38:47,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:38:47,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:38:47,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:38:47,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:38:47,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:38:47,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:38:47,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:38:47,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:38:47,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:38:47,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:38:47,832 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:38:47,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:38:48,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:38:48,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:38:48,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:38:48,143 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:38:48,145 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:38:48,146 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2020-10-05 23:38:48,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f7ebcfc/697e29c1eb1f44668cca38090772c3ee/FLAGaa8d5e2cd [2020-10-05 23:38:48,823 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:38:48,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2020-10-05 23:38:48,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f7ebcfc/697e29c1eb1f44668cca38090772c3ee/FLAGaa8d5e2cd [2020-10-05 23:38:49,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f7ebcfc/697e29c1eb1f44668cca38090772c3ee [2020-10-05 23:38:49,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:38:49,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:38:49,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:38:49,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:38:49,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:38:49,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f55431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49, skipping insertion in model container [2020-10-05 23:38:49,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:38:49,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:38:49,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:38:49,642 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:38:49,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:38:49,841 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:38:49,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49 WrapperNode [2020-10-05 23:38:49,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:38:49,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:38:49,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:38:49,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:38:49,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:38:49,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:38:49,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:38:49,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:38:49,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... [2020-10-05 23:38:49,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:38:49,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:38:49,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:38:49,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:38:49,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:38:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:38:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:38:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:38:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:38:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:38:50,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:38:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:38:50,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:38:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:38:50,031 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:38:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:38:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:38:50,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:38:50,033 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:38:52,119 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:38:52,119 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:38:52,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:38:52 BoogieIcfgContainer [2020-10-05 23:38:52,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:38:52,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:38:52,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:38:52,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:38:52,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:38:49" (1/3) ... [2020-10-05 23:38:52,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726bffc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:38:52, skipping insertion in model container [2020-10-05 23:38:52,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:49" (2/3) ... [2020-10-05 23:38:52,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726bffc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:38:52, skipping insertion in model container [2020-10-05 23:38:52,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:38:52" (3/3) ... [2020-10-05 23:38:52,129 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_pso.opt.i [2020-10-05 23:38:52,139 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:38:52,139 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:38:52,147 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:38:52,148 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:38:52,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,177 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,177 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,177 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,178 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,197 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,197 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,198 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:52,218 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:38:52,238 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:38:52,238 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:38:52,239 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:38:52,239 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:38:52,239 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:38:52,239 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:38:52,239 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:38:52,239 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:38:52,255 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-05 23:38:52,257 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-05 23:38:52,299 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-05 23:38:52,300 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:38:52,305 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:38:52,308 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-05 23:38:52,329 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-05 23:38:52,330 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:38:52,330 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:38:52,332 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1650 [2020-10-05 23:38:52,333 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:38:54,343 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-05 23:38:54,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-05 23:38:54,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:38:54,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 23:38:54,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:38:55,555 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-05 23:38:56,107 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:38:56,223 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:38:56,833 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-05 23:38:57,167 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-05 23:38:57,757 WARN L193 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-05 23:38:58,032 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-05 23:38:58,992 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 125 [2020-10-05 23:38:59,290 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-05 23:38:59,691 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-05 23:38:59,991 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:39:00,308 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-05 23:39:00,413 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-05 23:39:00,420 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4399 [2020-10-05 23:39:00,421 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2020-10-05 23:39:00,424 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-05 23:39:00,475 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-05 23:39:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-05 23:39:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:39:00,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:00,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:39:00,484 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1045083, now seen corresponding path program 1 times [2020-10-05 23:39:00,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:00,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297441650] [2020-10-05 23:39:00,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:00,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297441650] [2020-10-05 23:39:00,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:00,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:00,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054925762] [2020-10-05 23:39:00,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:00,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:00,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:00,773 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-05 23:39:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:00,878 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-05 23:39:00,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:00,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:39:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:00,914 INFO L225 Difference]: With dead ends: 687 [2020-10-05 23:39:00,914 INFO L226 Difference]: Without dead ends: 562 [2020-10-05 23:39:00,916 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-05 23:39:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-05 23:39:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-05 23:39:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-05 23:39:01,011 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-05 23:39:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:01,011 INFO L479 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-05 23:39:01,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-05 23:39:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:39:01,013 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:01,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:01,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:39:01,014 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:01,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:01,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1897044844, now seen corresponding path program 1 times [2020-10-05 23:39:01,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:01,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377267414] [2020-10-05 23:39:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:01,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377267414] [2020-10-05 23:39:01,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:01,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:01,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682947479] [2020-10-05 23:39:01,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:01,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:01,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:01,173 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-05 23:39:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:01,217 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-10-05 23:39:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:01,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:39:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:01,229 INFO L225 Difference]: With dead ends: 557 [2020-10-05 23:39:01,229 INFO L226 Difference]: Without dead ends: 557 [2020-10-05 23:39:01,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-05 23:39:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-05 23:39:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-05 23:39:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-10-05 23:39:01,287 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-10-05 23:39:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:01,288 INFO L479 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-10-05 23:39:01,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-10-05 23:39:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:39:01,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:01,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:01,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:39:01,292 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:01,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1295466417, now seen corresponding path program 1 times [2020-10-05 23:39:01,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:01,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100491770] [2020-10-05 23:39:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:01,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100491770] [2020-10-05 23:39:01,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:01,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:01,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041308030] [2020-10-05 23:39:01,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:01,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:01,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:01,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:01,399 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-10-05 23:39:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:01,411 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-10-05 23:39:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:01,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:39:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:01,417 INFO L225 Difference]: With dead ends: 537 [2020-10-05 23:39:01,417 INFO L226 Difference]: Without dead ends: 537 [2020-10-05 23:39:01,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-05 23:39:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-10-05 23:39:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-10-05 23:39:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-10-05 23:39:01,438 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 10 [2020-10-05 23:39:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:01,438 INFO L479 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-10-05 23:39:01,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-10-05 23:39:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:39:01,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:01,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:01,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:39:01,441 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:01,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:01,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1294542896, now seen corresponding path program 1 times [2020-10-05 23:39:01,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:01,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049806157] [2020-10-05 23:39:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:01,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049806157] [2020-10-05 23:39:01,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:01,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:39:01,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427622677] [2020-10-05 23:39:01,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:39:01,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:39:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:39:01,547 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 4 states. [2020-10-05 23:39:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:01,621 INFO L93 Difference]: Finished difference Result 701 states and 2070 transitions. [2020-10-05 23:39:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:39:01,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-05 23:39:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:01,625 INFO L225 Difference]: With dead ends: 701 [2020-10-05 23:39:01,626 INFO L226 Difference]: Without dead ends: 361 [2020-10-05 23:39:01,626 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-10-05 23:39:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2020-10-05 23:39:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-10-05 23:39:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1029 transitions. [2020-10-05 23:39:01,639 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1029 transitions. Word has length 10 [2020-10-05 23:39:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:01,639 INFO L479 AbstractCegarLoop]: Abstraction has 361 states and 1029 transitions. [2020-10-05 23:39:01,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:39:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1029 transitions. [2020-10-05 23:39:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:39:01,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:01,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:01,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:39:01,648 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:01,648 INFO L82 PathProgramCache]: Analyzing trace with hash -11306910, now seen corresponding path program 1 times [2020-10-05 23:39:01,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:01,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15305396] [2020-10-05 23:39:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:01,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15305396] [2020-10-05 23:39:01,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:01,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:39:01,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16731410] [2020-10-05 23:39:01,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:39:01,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:01,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:39:01,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:01,746 INFO L87 Difference]: Start difference. First operand 361 states and 1029 transitions. Second operand 3 states. [2020-10-05 23:39:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:01,755 INFO L93 Difference]: Finished difference Result 349 states and 988 transitions. [2020-10-05 23:39:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:39:01,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:39:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:01,759 INFO L225 Difference]: With dead ends: 349 [2020-10-05 23:39:01,759 INFO L226 Difference]: Without dead ends: 349 [2020-10-05 23:39:01,760 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:39:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-10-05 23:39:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2020-10-05 23:39:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-10-05 23:39:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 988 transitions. [2020-10-05 23:39:01,770 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 988 transitions. Word has length 12 [2020-10-05 23:39:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:01,771 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 988 transitions. [2020-10-05 23:39:01,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:39:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 988 transitions. [2020-10-05 23:39:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:39:01,772 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:01,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:01,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:39:01,772 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash -351998039, now seen corresponding path program 1 times [2020-10-05 23:39:01,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:01,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709948314] [2020-10-05 23:39:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:01,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709948314] [2020-10-05 23:39:01,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:01,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:39:01,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053317867] [2020-10-05 23:39:01,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:39:01,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:01,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:39:01,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:01,854 INFO L87 Difference]: Start difference. First operand 349 states and 988 transitions. Second operand 5 states. [2020-10-05 23:39:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:01,948 INFO L93 Difference]: Finished difference Result 445 states and 1244 transitions. [2020-10-05 23:39:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:39:01,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:39:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:01,951 INFO L225 Difference]: With dead ends: 445 [2020-10-05 23:39:01,951 INFO L226 Difference]: Without dead ends: 241 [2020-10-05 23:39:01,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:39:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-10-05 23:39:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2020-10-05 23:39:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-05 23:39:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 643 transitions. [2020-10-05 23:39:01,960 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 643 transitions. Word has length 13 [2020-10-05 23:39:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:01,960 INFO L479 AbstractCegarLoop]: Abstraction has 241 states and 643 transitions. [2020-10-05 23:39:01,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:39:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 643 transitions. [2020-10-05 23:39:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:39:01,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:01,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:01,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:39:01,961 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:01,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1582676509, now seen corresponding path program 1 times [2020-10-05 23:39:01,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:01,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153103689] [2020-10-05 23:39:01,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:02,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153103689] [2020-10-05 23:39:02,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:02,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:39:02,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104546389] [2020-10-05 23:39:02,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:39:02,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:02,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:39:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:39:02,067 INFO L87 Difference]: Start difference. First operand 241 states and 643 transitions. Second operand 4 states. [2020-10-05 23:39:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:02,128 INFO L93 Difference]: Finished difference Result 239 states and 635 transitions. [2020-10-05 23:39:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:39:02,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:39:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:02,131 INFO L225 Difference]: With dead ends: 239 [2020-10-05 23:39:02,131 INFO L226 Difference]: Without dead ends: 239 [2020-10-05 23:39:02,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-10-05 23:39:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2020-10-05 23:39:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-10-05 23:39:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 635 transitions. [2020-10-05 23:39:02,139 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 635 transitions. Word has length 14 [2020-10-05 23:39:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:02,139 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 635 transitions. [2020-10-05 23:39:02,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:39:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 635 transitions. [2020-10-05 23:39:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:39:02,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:02,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:02,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:39:02,141 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:02,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:02,141 INFO L82 PathProgramCache]: Analyzing trace with hash 582330823, now seen corresponding path program 1 times [2020-10-05 23:39:02,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:02,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975299876] [2020-10-05 23:39:02,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:02,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975299876] [2020-10-05 23:39:02,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:02,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:39:02,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441223351] [2020-10-05 23:39:02,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:39:02,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:02,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:39:02,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:39:02,282 INFO L87 Difference]: Start difference. First operand 239 states and 635 transitions. Second operand 4 states. [2020-10-05 23:39:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:02,320 INFO L93 Difference]: Finished difference Result 238 states and 565 transitions. [2020-10-05 23:39:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:39:02,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:39:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:02,322 INFO L225 Difference]: With dead ends: 238 [2020-10-05 23:39:02,322 INFO L226 Difference]: Without dead ends: 185 [2020-10-05 23:39:02,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-05 23:39:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2020-10-05 23:39:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-05 23:39:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 435 transitions. [2020-10-05 23:39:02,328 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 435 transitions. Word has length 15 [2020-10-05 23:39:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:02,328 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 435 transitions. [2020-10-05 23:39:02,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:39:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 435 transitions. [2020-10-05 23:39:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:39:02,329 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:02,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:02,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:39:02,330 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:02,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1622258957, now seen corresponding path program 1 times [2020-10-05 23:39:02,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:02,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564191920] [2020-10-05 23:39:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:02,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564191920] [2020-10-05 23:39:02,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:02,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:39:02,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113005492] [2020-10-05 23:39:02,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:39:02,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:02,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:39:02,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:39:02,414 INFO L87 Difference]: Start difference. First operand 185 states and 435 transitions. Second operand 5 states. [2020-10-05 23:39:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:02,457 INFO L93 Difference]: Finished difference Result 156 states and 331 transitions. [2020-10-05 23:39:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:39:02,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-05 23:39:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:02,459 INFO L225 Difference]: With dead ends: 156 [2020-10-05 23:39:02,459 INFO L226 Difference]: Without dead ends: 125 [2020-10-05 23:39:02,459 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:39:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-05 23:39:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-05 23:39:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-05 23:39:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 259 transitions. [2020-10-05 23:39:02,463 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 259 transitions. Word has length 16 [2020-10-05 23:39:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:02,463 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 259 transitions. [2020-10-05 23:39:02,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:39:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 259 transitions. [2020-10-05 23:39:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:39:02,464 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:02,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:02,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:39:02,465 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1548015784, now seen corresponding path program 1 times [2020-10-05 23:39:02,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:02,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480437014] [2020-10-05 23:39:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:02,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480437014] [2020-10-05 23:39:02,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:02,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:39:02,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204838340] [2020-10-05 23:39:02,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:39:02,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:02,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:39:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:39:02,563 INFO L87 Difference]: Start difference. First operand 125 states and 259 transitions. Second operand 6 states. [2020-10-05 23:39:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:02,633 INFO L93 Difference]: Finished difference Result 111 states and 229 transitions. [2020-10-05 23:39:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:39:02,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:39:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:02,634 INFO L225 Difference]: With dead ends: 111 [2020-10-05 23:39:02,635 INFO L226 Difference]: Without dead ends: 102 [2020-10-05 23:39:02,635 INFO L675 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-05 23:39:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-05 23:39:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-05 23:39:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-05 23:39:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 213 transitions. [2020-10-05 23:39:02,638 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 213 transitions. Word has length 18 [2020-10-05 23:39:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:02,639 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 213 transitions. [2020-10-05 23:39:02,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:39:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 213 transitions. [2020-10-05 23:39:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:39:02,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:02,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:02,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:39:02,640 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash 240041931, now seen corresponding path program 1 times [2020-10-05 23:39:02,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:02,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951913387] [2020-10-05 23:39:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:02,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951913387] [2020-10-05 23:39:02,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:02,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:39:02,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196241045] [2020-10-05 23:39:02,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:39:02,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:39:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:39:02,770 INFO L87 Difference]: Start difference. First operand 102 states and 213 transitions. Second operand 7 states. [2020-10-05 23:39:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:02,884 INFO L93 Difference]: Finished difference Result 128 states and 261 transitions. [2020-10-05 23:39:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:39:02,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:39:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:02,886 INFO L225 Difference]: With dead ends: 128 [2020-10-05 23:39:02,886 INFO L226 Difference]: Without dead ends: 98 [2020-10-05 23:39:02,887 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:39:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-05 23:39:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2020-10-05 23:39:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-05 23:39:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 165 transitions. [2020-10-05 23:39:02,890 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 165 transitions. Word has length 21 [2020-10-05 23:39:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:02,890 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 165 transitions. [2020-10-05 23:39:02,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:39:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 165 transitions. [2020-10-05 23:39:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:39:02,891 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:02,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:02,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:39:02,892 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:02,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:02,892 INFO L82 PathProgramCache]: Analyzing trace with hash -578037119, now seen corresponding path program 2 times [2020-10-05 23:39:02,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:02,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047473342] [2020-10-05 23:39:02,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:39:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:39:03,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047473342] [2020-10-05 23:39:03,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:39:03,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:39:03,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215102582] [2020-10-05 23:39:03,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:39:03,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:39:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:39:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:39:03,109 INFO L87 Difference]: Start difference. First operand 86 states and 165 transitions. Second operand 8 states. [2020-10-05 23:39:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:39:03,265 INFO L93 Difference]: Finished difference Result 108 states and 205 transitions. [2020-10-05 23:39:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:39:03,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-05 23:39:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:39:03,267 INFO L225 Difference]: With dead ends: 108 [2020-10-05 23:39:03,268 INFO L226 Difference]: Without dead ends: 64 [2020-10-05 23:39:03,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:39:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-05 23:39:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2020-10-05 23:39:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-05 23:39:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-05 23:39:03,271 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 21 [2020-10-05 23:39:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:39:03,271 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-05 23:39:03,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:39:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-05 23:39:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:39:03,272 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:39:03,272 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:39:03,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:39:03,273 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:39:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:39:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1230847573, now seen corresponding path program 3 times [2020-10-05 23:39:03,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:39:03,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494967766] [2020-10-05 23:39:03,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:39:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:39:03,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:39:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:39:03,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:39:03,438 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:39:03,439 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:39:03,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:39:03,440 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:39:03,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L2-->L825: Formula: (let ((.cse7 (= (mod ~z$w_buff1_used~0_In-673103038 256) 0)) (.cse6 (= (mod ~z$r_buff1_thd0~0_In-673103038 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In-673103038 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In-673103038 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-673103038 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-673103038|) (= ~z$r_buff1_thd0~0_Out-673103038 ~z$r_buff1_thd0~0_In-673103038) (or (and (= ~z$w_buff0_used~0_Out-673103038 0) .cse0 .cse1) (and (= ~z$w_buff0_used~0_Out-673103038 ~z$w_buff0_used~0_In-673103038) .cse2)) (or (and (or (and (= ~z$w_buff1~0_In-673103038 ~z~0_Out-673103038) .cse3 .cse4) (and .cse5 (= ~z~0_In-673103038 ~z~0_Out-673103038))) .cse2) (and .cse0 (= ~z~0_Out-673103038 ~z$w_buff0~0_In-673103038) .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-673103038 0)) (= ~z$r_buff0_thd0~0_In-673103038 ~z$r_buff0_thd0~0_Out-673103038) (or (and .cse5 (= ~z$w_buff1_used~0_Out-673103038 ~z$w_buff1_used~0_In-673103038)) (and .cse3 .cse4 (= ~z$w_buff1_used~0_Out-673103038 0)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-673103038|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-673103038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-673103038, ~z$w_buff0~0=~z$w_buff0~0_In-673103038, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-673103038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-673103038, ~z$w_buff1~0=~z$w_buff1~0_In-673103038, ~z~0=~z~0_In-673103038} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-673103038|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-673103038, ~z$w_buff0~0=~z$w_buff0~0_In-673103038, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-673103038, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-673103038|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-673103038|, ~z$w_buff1~0=~z$w_buff1~0_In-673103038, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-673103038|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-673103038|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-673103038|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-673103038|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-673103038, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-673103038, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-673103038, ~z~0=~z~0_Out-673103038} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~z~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:39:03,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:39:03,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:39:03,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:39:03 BasicIcfg [2020-10-05 23:39:03,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:39:03,543 INFO L168 Benchmark]: Toolchain (without parser) took 14449.47 ms. Allocated memory was 149.4 MB in the beginning and 375.4 MB in the end (delta: 226.0 MB). Free memory was 103.6 MB in the beginning and 276.9 MB in the end (delta: -173.3 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:03,543 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 149.4 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:39:03,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.90 ms. Allocated memory was 149.4 MB in the beginning and 206.0 MB in the end (delta: 56.6 MB). Free memory was 103.4 MB in the beginning and 159.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:03,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.99 ms. Allocated memory is still 206.0 MB. Free memory was 159.2 MB in the beginning and 156.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:03,545 INFO L168 Benchmark]: Boogie Preprocessor took 56.37 ms. Allocated memory is still 206.0 MB. Free memory was 156.1 MB in the beginning and 154.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:03,546 INFO L168 Benchmark]: RCFGBuilder took 2150.16 ms. Allocated memory was 206.0 MB in the beginning and 243.3 MB in the end (delta: 37.2 MB). Free memory was 153.6 MB in the beginning and 147.9 MB in the end (delta: 5.7 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:03,547 INFO L168 Benchmark]: TraceAbstraction took 11418.29 ms. Allocated memory was 243.3 MB in the beginning and 375.4 MB in the end (delta: 132.1 MB). Free memory was 147.9 MB in the beginning and 276.9 MB in the end (delta: -129.0 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:39:03,551 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.36 ms. Allocated memory is still 149.4 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.90 ms. Allocated memory was 149.4 MB in the beginning and 206.0 MB in the end (delta: 56.6 MB). Free memory was 103.4 MB in the beginning and 159.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.99 ms. Allocated memory is still 206.0 MB. Free memory was 159.2 MB in the beginning and 156.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.37 ms. Allocated memory is still 206.0 MB. Free memory was 156.1 MB in the beginning and 154.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2150.16 ms. Allocated memory was 206.0 MB in the beginning and 243.3 MB in the end (delta: 37.2 MB). Free memory was 153.6 MB in the beginning and 147.9 MB in the end (delta: 5.7 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11418.29 ms. Allocated memory was 243.3 MB in the beginning and 375.4 MB in the end (delta: 132.1 MB). Free memory was 147.9 MB in the beginning and 276.9 MB in the end (delta: -129.0 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.1s, 101 ProgramPointsBefore, 36 ProgramPointsAfterwards, 93 TransitionsBefore, 26 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 853 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4399 CheckedPairsTotal, 76 TotalNumberOfCompositions - 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_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L708] 0 int y = 0; [L710] 0 int z = 0; [L711] 0 _Bool z$flush_delayed; [L712] 0 int z$mem_tmp; [L713] 0 _Bool z$r_buff0_thd0; [L714] 0 _Bool z$r_buff0_thd1; [L715] 0 _Bool z$r_buff0_thd2; [L716] 0 _Bool z$r_buff0_thd3; [L717] 0 _Bool z$r_buff1_thd0; [L718] 0 _Bool z$r_buff1_thd1; [L719] 0 _Bool z$r_buff1_thd2; [L720] 0 _Bool z$r_buff1_thd3; [L721] 0 _Bool z$read_delayed; [L722] 0 int *z$read_delayed_var; [L723] 0 int z$w_buff0; [L724] 0 _Bool z$w_buff0_used; [L725] 0 int z$w_buff1; [L726] 0 _Bool z$w_buff1_used; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t1970; [L810] FCALL, FORK 0 pthread_create(&t1970, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t1971; [L812] FCALL, FORK 0 pthread_create(&t1971, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 pthread_t t1972; [L732] 1 z$w_buff1 = z$w_buff0 [L733] 1 z$w_buff0 = 2 [L734] 1 z$w_buff1_used = z$w_buff0_used [L735] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L737] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L738] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L739] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L740] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L741] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L770] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L771] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L814] FCALL, FORK 0 pthread_create(&t1972, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L749] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L750] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L751] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 z$flush_delayed = weak$$choice2 [L830] 0 z$mem_tmp = z [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L831] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L833] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L834] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L834] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L839] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L839] 0 z = z$flush_delayed ? z$mem_tmp : z [L840] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 233 SDtfs, 293 SDslu, 383 SDs, 0 SdLazy, 238 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred 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, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 18582 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...