/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr000_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 12:41:37,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 12:41:37,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 12:41:37,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 12:41:37,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 12:41:37,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 12:41:37,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 12:41:37,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 12:41:37,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 12:41:37,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 12:41:37,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 12:41:37,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 12:41:37,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 12:41:37,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 12:41:37,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 12:41:37,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 12:41:37,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 12:41:37,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 12:41:37,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 12:41:37,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 12:41:37,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 12:41:37,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 12:41:37,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 12:41:37,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 12:41:37,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 12:41:37,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 12:41:37,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 12:41:37,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 12:41:37,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 12:41:37,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 12:41:37,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 12:41:37,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 12:41:37,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 12:41:37,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 12:41:37,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 12:41:37,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 12:41:37,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 12:41:37,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 12:41:37,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 12:41:37,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 12:41:37,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 12:41:37,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 12:41:37,164 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 12:41:37,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 12:41:37,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 12:41:37,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 12:41:37,166 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 12:41:37,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 12:41:37,166 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 12:41:37,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 12:41:37,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 12:41:37,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 12:41:37,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 12:41:37,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 12:41:37,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 12:41:37,167 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 12:41:37,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 12:41:37,168 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 12:41:37,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 12:41:37,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 12:41:37,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 12:41:37,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 12:41:37,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 12:41:37,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 12:41:37,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 12:41:37,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 12:41:37,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 12:41:37,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 12:41:37,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 12:41:37,170 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 12:41:37,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 12:41:37,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 12:41:37,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 12:41:37,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 12:41:37,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 12:41:37,467 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 12:41:37,468 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 12:41:37,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr000_pso.oepc.i [2019-12-27 12:41:37,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8daaef94c/e51b8946cdff4c4991f9f2348322b543/FLAGbe156bae7 [2019-12-27 12:41:38,138 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 12:41:38,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr000_pso.oepc.i [2019-12-27 12:41:38,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8daaef94c/e51b8946cdff4c4991f9f2348322b543/FLAGbe156bae7 [2019-12-27 12:41:38,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8daaef94c/e51b8946cdff4c4991f9f2348322b543 [2019-12-27 12:41:38,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 12:41:38,372 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 12:41:38,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 12:41:38,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 12:41:38,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 12:41:38,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:41:38" (1/1) ... [2019-12-27 12:41:38,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49853036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:38, skipping insertion in model container [2019-12-27 12:41:38,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:41:38" (1/1) ... [2019-12-27 12:41:38,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 12:41:38,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 12:41:38,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:41:38,961 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 12:41:39,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:41:39,113 INFO L208 MainTranslator]: Completed translation [2019-12-27 12:41:39,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39 WrapperNode [2019-12-27 12:41:39,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 12:41:39,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 12:41:39,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 12:41:39,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 12:41:39,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (1/1) ... [2019-12-27 12:41:39,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (1/1) ... [2019-12-27 12:41:39,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 12:41:39,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 12:41:39,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 12:41:39,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 12:41:39,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (1/1) ... [2019-12-27 12:41:39,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (1/1) ... [2019-12-27 12:41:39,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (1/1) ... [2019-12-27 12:41:39,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (1/1) ... [2019-12-27 12:41:39,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (1/1) ... [2019-12-27 12:41:39,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (1/1) ... [2019-12-27 12:41:39,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (1/1) ... [2019-12-27 12:41:39,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 12:41:39,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 12:41:39,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 12:41:39,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 12:41:39,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (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 [2019-12-27 12:41:39,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 12:41:39,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 12:41:39,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 12:41:39,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 12:41:39,292 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 12:41:39,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 12:41:39,293 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 12:41:39,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 12:41:39,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 12:41:39,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 12:41:39,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 12:41:39,295 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 12:41:39,995 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 12:41:39,996 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 12:41:39,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:41:39 BoogieIcfgContainer [2019-12-27 12:41:39,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 12:41:39,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 12:41:39,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 12:41:40,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 12:41:40,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:41:38" (1/3) ... [2019-12-27 12:41:40,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314f8b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:41:40, skipping insertion in model container [2019-12-27 12:41:40,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:41:39" (2/3) ... [2019-12-27 12:41:40,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314f8b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:41:40, skipping insertion in model container [2019-12-27 12:41:40,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:41:39" (3/3) ... [2019-12-27 12:41:40,007 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_pso.oepc.i [2019-12-27 12:41:40,018 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 12:41:40,019 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 12:41:40,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 12:41:40,028 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 12:41:40,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,080 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,080 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,157 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:41:40,179 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 12:41:40,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 12:41:40,202 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 12:41:40,202 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 12:41:40,202 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 12:41:40,202 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 12:41:40,202 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 12:41:40,203 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 12:41:40,203 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 12:41:40,224 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-27 12:41:42,339 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-27 12:41:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-27 12:41:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 12:41:42,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:41:42,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:41:42,351 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:41:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:41:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash -211488886, now seen corresponding path program 1 times [2019-12-27 12:41:42,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:41:42,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454616241] [2019-12-27 12:41:42,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:41:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:41:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:41:42,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454616241] [2019-12-27 12:41:42,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:41:42,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:41:42,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12675602] [2019-12-27 12:41:42,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:41:42,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:41:42,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:41:42,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:41:42,663 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-27 12:41:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:41:43,390 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-27 12:41:43,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:41:43,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-27 12:41:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:41:44,560 INFO L225 Difference]: With dead ends: 33591 [2019-12-27 12:41:44,560 INFO L226 Difference]: Without dead ends: 25703 [2019-12-27 12:41:44,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:41:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-27 12:41:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-27 12:41:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-27 12:41:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-27 12:41:45,979 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-27 12:41:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:41:45,980 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-27 12:41:45,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:41:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-27 12:41:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 12:41:45,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:41:45,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:41:45,993 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:41:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:41:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1616921250, now seen corresponding path program 1 times [2019-12-27 12:41:45,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:41:45,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192086044] [2019-12-27 12:41:45,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:41:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:41:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:41:46,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192086044] [2019-12-27 12:41:46,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:41:46,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:41:46,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844872536] [2019-12-27 12:41:46,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:41:46,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:41:46,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:41:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:41:46,150 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-27 12:41:46,442 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-27 12:41:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:41:47,311 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-27 12:41:47,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:41:47,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-27 12:41:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:41:47,495 INFO L225 Difference]: With dead ends: 41081 [2019-12-27 12:41:47,495 INFO L226 Difference]: Without dead ends: 40545 [2019-12-27 12:41:47,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:41:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-27 12:41:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-27 12:41:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-27 12:41:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-27 12:41:50,245 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-27 12:41:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:41:50,247 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-27 12:41:50,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:41:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-27 12:41:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 12:41:50,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:41:50,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:41:50,257 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:41:50,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:41:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash -7572596, now seen corresponding path program 1 times [2019-12-27 12:41:50,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:41:50,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502387876] [2019-12-27 12:41:50,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:41:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:41:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:41:50,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502387876] [2019-12-27 12:41:50,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:41:50,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:41:50,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947908047] [2019-12-27 12:41:50,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:41:50,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:41:50,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:41:50,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:41:50,412 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-27 12:41:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:41:52,520 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-27 12:41:52,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:41:52,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 12:41:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:41:52,686 INFO L225 Difference]: With dead ends: 49778 [2019-12-27 12:41:52,686 INFO L226 Difference]: Without dead ends: 49274 [2019-12-27 12:41:52,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:41:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-27 12:41:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-27 12:41:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-27 12:41:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-27 12:41:54,101 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-27 12:41:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:41:54,102 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-27 12:41:54,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:41:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-27 12:41:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 12:41:54,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:41:54,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:41:54,110 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:41:54,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:41:54,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2011067022, now seen corresponding path program 1 times [2019-12-27 12:41:54,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:41:54,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714865227] [2019-12-27 12:41:54,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:41:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:41:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:41:54,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714865227] [2019-12-27 12:41:54,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:41:54,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:41:54,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454585653] [2019-12-27 12:41:54,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:41:54,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:41:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:41:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:41:54,183 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-27 12:41:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:41:55,001 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-27 12:41:55,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:41:55,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-27 12:41:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:41:55,207 INFO L225 Difference]: With dead ends: 61087 [2019-12-27 12:41:55,207 INFO L226 Difference]: Without dead ends: 61087 [2019-12-27 12:41:55,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:41:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-27 12:41:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-27 12:41:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-27 12:41:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-27 12:41:58,345 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-27 12:41:58,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:41:58,345 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-27 12:41:58,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:41:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-27 12:41:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 12:41:58,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:41:58,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:41:58,362 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:41:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:41:58,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1033937592, now seen corresponding path program 1 times [2019-12-27 12:41:58,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:41:58,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213407478] [2019-12-27 12:41:58,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:41:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:41:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:41:58,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213407478] [2019-12-27 12:41:58,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:41:58,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:41:58,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291652245] [2019-12-27 12:41:58,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:41:58,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:41:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:41:58,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:41:58,525 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-12-27 12:41:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:41:59,545 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-12-27 12:41:59,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:41:59,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 12:41:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:00,181 INFO L225 Difference]: With dead ends: 63756 [2019-12-27 12:42:00,182 INFO L226 Difference]: Without dead ends: 63756 [2019-12-27 12:42:00,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:42:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-12-27 12:42:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-12-27 12:42:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-27 12:42:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-27 12:42:03,718 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-27 12:42:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:03,718 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-27 12:42:03,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:42:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-27 12:42:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 12:42:03,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:03,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:03,741 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1464078345, now seen corresponding path program 1 times [2019-12-27 12:42:03,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:03,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692083544] [2019-12-27 12:42:03,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:03,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692083544] [2019-12-27 12:42:03,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:03,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:42:03,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372037354] [2019-12-27 12:42:03,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:42:03,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:03,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:42:03,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:42:03,854 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-27 12:42:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:05,305 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-27 12:42:05,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:42:05,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 12:42:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:05,468 INFO L225 Difference]: With dead ends: 83685 [2019-12-27 12:42:05,469 INFO L226 Difference]: Without dead ends: 83685 [2019-12-27 12:42:05,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:42:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-27 12:42:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-27 12:42:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-27 12:42:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-27 12:42:10,265 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-27 12:42:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:10,266 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-27 12:42:10,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:42:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-27 12:42:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 12:42:10,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:10,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:10,283 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:10,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1943385270, now seen corresponding path program 1 times [2019-12-27 12:42:10,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:10,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204093280] [2019-12-27 12:42:10,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:10,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204093280] [2019-12-27 12:42:10,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:10,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:42:10,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529669962] [2019-12-27 12:42:10,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:42:10,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:10,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:42:10,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:42:10,345 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states. [2019-12-27 12:42:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:10,575 INFO L93 Difference]: Finished difference Result 54021 states and 188918 transitions. [2019-12-27 12:42:10,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:42:10,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 12:42:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:10,688 INFO L225 Difference]: With dead ends: 54021 [2019-12-27 12:42:10,688 INFO L226 Difference]: Without dead ends: 54021 [2019-12-27 12:42:10,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:42:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54021 states. [2019-12-27 12:42:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406. [2019-12-27 12:42:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53406 states. [2019-12-27 12:42:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions. [2019-12-27 12:42:12,058 INFO L78 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53 [2019-12-27 12:42:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:12,058 INFO L462 AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions. [2019-12-27 12:42:12,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:42:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions. [2019-12-27 12:42:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 12:42:12,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:12,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:12,067 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash -870863555, now seen corresponding path program 1 times [2019-12-27 12:42:12,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:12,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536467452] [2019-12-27 12:42:12,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:12,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536467452] [2019-12-27 12:42:12,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:12,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:42:12,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998154526] [2019-12-27 12:42:12,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:42:12,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:12,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:42:12,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:42:12,132 INFO L87 Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states. [2019-12-27 12:42:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:12,844 INFO L93 Difference]: Finished difference Result 68646 states and 237301 transitions. [2019-12-27 12:42:12,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:42:12,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 12:42:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:12,995 INFO L225 Difference]: With dead ends: 68646 [2019-12-27 12:42:12,996 INFO L226 Difference]: Without dead ends: 68078 [2019-12-27 12:42:12,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 12:42:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68078 states. [2019-12-27 12:42:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490. [2019-12-27 12:42:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53490 states. [2019-12-27 12:42:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions. [2019-12-27 12:42:14,635 INFO L78 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53 [2019-12-27 12:42:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:14,636 INFO L462 AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions. [2019-12-27 12:42:14,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:42:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions. [2019-12-27 12:42:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:42:14,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:14,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:14,646 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:14,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash 57224143, now seen corresponding path program 1 times [2019-12-27 12:42:14,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:14,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115744221] [2019-12-27 12:42:14,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:14,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115744221] [2019-12-27 12:42:14,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:14,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:42:14,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604855935] [2019-12-27 12:42:14,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:42:14,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:14,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:42:14,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:42:14,763 INFO L87 Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states. [2019-12-27 12:42:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:15,854 INFO L93 Difference]: Finished difference Result 67849 states and 231360 transitions. [2019-12-27 12:42:15,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:42:15,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 12:42:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:15,995 INFO L225 Difference]: With dead ends: 67849 [2019-12-27 12:42:15,996 INFO L226 Difference]: Without dead ends: 67849 [2019-12-27 12:42:15,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:42:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67849 states. [2019-12-27 12:42:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081. [2019-12-27 12:42:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59081 states. [2019-12-27 12:42:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions. [2019-12-27 12:42:17,669 INFO L78 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54 [2019-12-27 12:42:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:17,669 INFO L462 AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions. [2019-12-27 12:42:17,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:42:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions. [2019-12-27 12:42:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:42:17,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:17,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:17,680 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash 944727824, now seen corresponding path program 1 times [2019-12-27 12:42:17,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:17,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289748541] [2019-12-27 12:42:17,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:17,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289748541] [2019-12-27 12:42:17,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:17,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:42:17,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109418311] [2019-12-27 12:42:17,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:42:17,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:42:17,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:42:17,749 INFO L87 Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states. [2019-12-27 12:42:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:17,804 INFO L93 Difference]: Finished difference Result 10212 states and 31246 transitions. [2019-12-27 12:42:17,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:42:17,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 12:42:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:17,817 INFO L225 Difference]: With dead ends: 10212 [2019-12-27 12:42:17,817 INFO L226 Difference]: Without dead ends: 8507 [2019-12-27 12:42:17,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2019-12-27 12:42:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459. [2019-12-27 12:42:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8459 states. [2019-12-27 12:42:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions. [2019-12-27 12:42:17,920 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54 [2019-12-27 12:42:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:17,921 INFO L462 AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions. [2019-12-27 12:42:17,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:42:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions. [2019-12-27 12:42:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 12:42:17,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:17,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:17,926 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:17,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:17,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1459800295, now seen corresponding path program 1 times [2019-12-27 12:42:17,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:17,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014785684] [2019-12-27 12:42:17,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:17,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014785684] [2019-12-27 12:42:17,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:17,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:42:17,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921010906] [2019-12-27 12:42:17,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:42:17,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:17,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:42:17,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:42:17,984 INFO L87 Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states. [2019-12-27 12:42:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:18,106 INFO L93 Difference]: Finished difference Result 9706 states and 29104 transitions. [2019-12-27 12:42:18,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:42:18,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 12:42:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:18,125 INFO L225 Difference]: With dead ends: 9706 [2019-12-27 12:42:18,125 INFO L226 Difference]: Without dead ends: 9706 [2019-12-27 12:42:18,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-12-27 12:42:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879. [2019-12-27 12:42:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8879 states. [2019-12-27 12:42:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions. [2019-12-27 12:42:18,242 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61 [2019-12-27 12:42:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:18,242 INFO L462 AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions. [2019-12-27 12:42:18,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:42:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions. [2019-12-27 12:42:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 12:42:18,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:18,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:18,246 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash 283010040, now seen corresponding path program 1 times [2019-12-27 12:42:18,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:18,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536133954] [2019-12-27 12:42:18,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:18,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536133954] [2019-12-27 12:42:18,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:18,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:42:18,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459134009] [2019-12-27 12:42:18,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:42:18,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:18,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:42:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:42:18,319 INFO L87 Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states. [2019-12-27 12:42:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:18,790 INFO L93 Difference]: Finished difference Result 11195 states and 33075 transitions. [2019-12-27 12:42:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 12:42:18,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 12:42:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:18,809 INFO L225 Difference]: With dead ends: 11195 [2019-12-27 12:42:18,809 INFO L226 Difference]: Without dead ends: 11134 [2019-12-27 12:42:18,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:42:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2019-12-27 12:42:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410. [2019-12-27 12:42:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10410 states. [2019-12-27 12:42:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions. [2019-12-27 12:42:18,934 INFO L78 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61 [2019-12-27 12:42:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:18,934 INFO L462 AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions. [2019-12-27 12:42:18,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:42:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions. [2019-12-27 12:42:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 12:42:18,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:18,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:18,942 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:18,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2090643056, now seen corresponding path program 1 times [2019-12-27 12:42:18,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:18,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012760445] [2019-12-27 12:42:18,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:18,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012760445] [2019-12-27 12:42:18,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:18,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:42:18,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493664885] [2019-12-27 12:42:18,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:42:18,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:18,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:42:18,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:42:18,982 INFO L87 Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 4 states. [2019-12-27 12:42:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:19,361 INFO L93 Difference]: Finished difference Result 15178 states and 44225 transitions. [2019-12-27 12:42:19,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:42:19,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 12:42:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:19,381 INFO L225 Difference]: With dead ends: 15178 [2019-12-27 12:42:19,382 INFO L226 Difference]: Without dead ends: 15178 [2019-12-27 12:42:19,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2019-12-27 12:42:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727. [2019-12-27 12:42:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-27 12:42:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions. [2019-12-27 12:42:19,546 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67 [2019-12-27 12:42:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:19,546 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions. [2019-12-27 12:42:19,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:42:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions. [2019-12-27 12:42:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 12:42:19,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:19,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:19,553 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:19,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash -959559759, now seen corresponding path program 1 times [2019-12-27 12:42:19,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:19,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669908728] [2019-12-27 12:42:19,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:19,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669908728] [2019-12-27 12:42:19,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:19,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:42:19,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128516160] [2019-12-27 12:42:19,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:42:19,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:42:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:42:19,657 INFO L87 Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 6 states. [2019-12-27 12:42:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:20,094 INFO L93 Difference]: Finished difference Result 12772 states and 36832 transitions. [2019-12-27 12:42:20,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 12:42:20,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 12:42:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:20,112 INFO L225 Difference]: With dead ends: 12772 [2019-12-27 12:42:20,112 INFO L226 Difference]: Without dead ends: 12772 [2019-12-27 12:42:20,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:42:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2019-12-27 12:42:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925. [2019-12-27 12:42:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11925 states. [2019-12-27 12:42:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions. [2019-12-27 12:42:20,262 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67 [2019-12-27 12:42:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:20,262 INFO L462 AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions. [2019-12-27 12:42:20,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:42:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions. [2019-12-27 12:42:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 12:42:20,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:20,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:20,269 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash -748208846, now seen corresponding path program 1 times [2019-12-27 12:42:20,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:20,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770311011] [2019-12-27 12:42:20,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:20,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770311011] [2019-12-27 12:42:20,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:20,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:42:20,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570874363] [2019-12-27 12:42:20,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:42:20,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:20,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:42:20,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:20,367 INFO L87 Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 5 states. [2019-12-27 12:42:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:20,868 INFO L93 Difference]: Finished difference Result 15220 states and 44029 transitions. [2019-12-27 12:42:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:42:20,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 12:42:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:20,888 INFO L225 Difference]: With dead ends: 15220 [2019-12-27 12:42:20,888 INFO L226 Difference]: Without dead ends: 15220 [2019-12-27 12:42:20,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:42:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15220 states. [2019-12-27 12:42:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156. [2019-12-27 12:42:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-12-27 12:42:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions. [2019-12-27 12:42:21,074 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67 [2019-12-27 12:42:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:21,074 INFO L462 AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions. [2019-12-27 12:42:21,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:42:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions. [2019-12-27 12:42:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 12:42:21,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:21,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:21,083 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:21,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:21,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1258743023, now seen corresponding path program 1 times [2019-12-27 12:42:21,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:21,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434250110] [2019-12-27 12:42:21,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:21,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434250110] [2019-12-27 12:42:21,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:21,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:42:21,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815844679] [2019-12-27 12:42:21,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:42:21,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:21,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:42:21,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:42:21,130 INFO L87 Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 4 states. [2019-12-27 12:42:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:21,724 INFO L93 Difference]: Finished difference Result 17525 states and 50589 transitions. [2019-12-27 12:42:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:42:21,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 12:42:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:21,749 INFO L225 Difference]: With dead ends: 17525 [2019-12-27 12:42:21,749 INFO L226 Difference]: Without dead ends: 17354 [2019-12-27 12:42:21,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17354 states. [2019-12-27 12:42:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 16508. [2019-12-27 12:42:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16508 states. [2019-12-27 12:42:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16508 states to 16508 states and 47592 transitions. [2019-12-27 12:42:22,040 INFO L78 Accepts]: Start accepts. Automaton has 16508 states and 47592 transitions. Word has length 67 [2019-12-27 12:42:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:22,040 INFO L462 AbstractCegarLoop]: Abstraction has 16508 states and 47592 transitions. [2019-12-27 12:42:22,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:42:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 16508 states and 47592 transitions. [2019-12-27 12:42:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 12:42:22,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:22,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:22,050 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:22,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1239272914, now seen corresponding path program 1 times [2019-12-27 12:42:22,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:22,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597355616] [2019-12-27 12:42:22,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:22,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597355616] [2019-12-27 12:42:22,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:22,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:42:22,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352226146] [2019-12-27 12:42:22,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:42:22,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:22,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:42:22,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:42:22,208 INFO L87 Difference]: Start difference. First operand 16508 states and 47592 transitions. Second operand 7 states. [2019-12-27 12:42:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:22,827 INFO L93 Difference]: Finished difference Result 21898 states and 61512 transitions. [2019-12-27 12:42:22,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 12:42:22,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 12:42:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:22,855 INFO L225 Difference]: With dead ends: 21898 [2019-12-27 12:42:22,855 INFO L226 Difference]: Without dead ends: 21898 [2019-12-27 12:42:22,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:42:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-12-27 12:42:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 18377. [2019-12-27 12:42:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-12-27 12:42:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 51655 transitions. [2019-12-27 12:42:23,089 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 51655 transitions. Word has length 67 [2019-12-27 12:42:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:23,089 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 51655 transitions. [2019-12-27 12:42:23,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:42:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 51655 transitions. [2019-12-27 12:42:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 12:42:23,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:23,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:23,097 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:23,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2126776595, now seen corresponding path program 1 times [2019-12-27 12:42:23,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:23,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68406600] [2019-12-27 12:42:23,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:23,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68406600] [2019-12-27 12:42:23,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:23,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:42:23,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188205072] [2019-12-27 12:42:23,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:42:23,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:23,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:42:23,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:23,177 INFO L87 Difference]: Start difference. First operand 18377 states and 51655 transitions. Second operand 5 states. [2019-12-27 12:42:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:23,233 INFO L93 Difference]: Finished difference Result 5654 states and 13548 transitions. [2019-12-27 12:42:23,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:42:23,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 12:42:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:23,240 INFO L225 Difference]: With dead ends: 5654 [2019-12-27 12:42:23,241 INFO L226 Difference]: Without dead ends: 4682 [2019-12-27 12:42:23,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:42:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-12-27 12:42:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 3847. [2019-12-27 12:42:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-12-27 12:42:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 9034 transitions. [2019-12-27 12:42:23,305 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 9034 transitions. Word has length 67 [2019-12-27 12:42:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:23,305 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 9034 transitions. [2019-12-27 12:42:23,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:42:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 9034 transitions. [2019-12-27 12:42:23,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 12:42:23,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:23,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:23,311 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:23,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:23,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1987685399, now seen corresponding path program 1 times [2019-12-27 12:42:23,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:23,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370078819] [2019-12-27 12:42:23,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:23,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370078819] [2019-12-27 12:42:23,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:23,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:42:23,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850506494] [2019-12-27 12:42:23,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:42:23,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:23,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:42:23,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:42:23,340 INFO L87 Difference]: Start difference. First operand 3847 states and 9034 transitions. Second operand 3 states. [2019-12-27 12:42:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:23,380 INFO L93 Difference]: Finished difference Result 4819 states and 11125 transitions. [2019-12-27 12:42:23,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:42:23,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 12:42:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:23,386 INFO L225 Difference]: With dead ends: 4819 [2019-12-27 12:42:23,386 INFO L226 Difference]: Without dead ends: 4819 [2019-12-27 12:42:23,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:42:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-12-27 12:42:23,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3790. [2019-12-27 12:42:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2019-12-27 12:42:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 8687 transitions. [2019-12-27 12:42:23,441 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 8687 transitions. Word has length 67 [2019-12-27 12:42:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:23,442 INFO L462 AbstractCegarLoop]: Abstraction has 3790 states and 8687 transitions. [2019-12-27 12:42:23,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:42:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 8687 transitions. [2019-12-27 12:42:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 12:42:23,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:23,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:23,445 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash -788602436, now seen corresponding path program 1 times [2019-12-27 12:42:23,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:23,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760061216] [2019-12-27 12:42:23,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:23,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760061216] [2019-12-27 12:42:23,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:23,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:42:23,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487724188] [2019-12-27 12:42:23,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:42:23,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:23,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:42:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:23,500 INFO L87 Difference]: Start difference. First operand 3790 states and 8687 transitions. Second operand 5 states. [2019-12-27 12:42:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:23,654 INFO L93 Difference]: Finished difference Result 4737 states and 10904 transitions. [2019-12-27 12:42:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 12:42:23,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-27 12:42:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:23,661 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 12:42:23,661 INFO L226 Difference]: Without dead ends: 4737 [2019-12-27 12:42:23,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:42:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2019-12-27 12:42:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4176. [2019-12-27 12:42:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4176 states. [2019-12-27 12:42:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 9598 transitions. [2019-12-27 12:42:23,706 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 9598 transitions. Word has length 73 [2019-12-27 12:42:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:23,707 INFO L462 AbstractCegarLoop]: Abstraction has 4176 states and 9598 transitions. [2019-12-27 12:42:23,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:42:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 9598 transitions. [2019-12-27 12:42:23,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 12:42:23,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:23,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:23,711 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:23,711 INFO L82 PathProgramCache]: Analyzing trace with hash 954207899, now seen corresponding path program 1 times [2019-12-27 12:42:23,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:23,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692731675] [2019-12-27 12:42:23,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:23,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692731675] [2019-12-27 12:42:23,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:23,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:42:23,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545295457] [2019-12-27 12:42:23,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:42:23,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:23,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:42:23,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:42:23,795 INFO L87 Difference]: Start difference. First operand 4176 states and 9598 transitions. Second operand 7 states. [2019-12-27 12:42:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:24,253 INFO L93 Difference]: Finished difference Result 4873 states and 11063 transitions. [2019-12-27 12:42:24,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:42:24,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-27 12:42:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:24,261 INFO L225 Difference]: With dead ends: 4873 [2019-12-27 12:42:24,261 INFO L226 Difference]: Without dead ends: 4820 [2019-12-27 12:42:24,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 12:42:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2019-12-27 12:42:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4234. [2019-12-27 12:42:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2019-12-27 12:42:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 9647 transitions. [2019-12-27 12:42:24,303 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 9647 transitions. Word has length 73 [2019-12-27 12:42:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:24,304 INFO L462 AbstractCegarLoop]: Abstraction has 4234 states and 9647 transitions. [2019-12-27 12:42:24,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:42:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 9647 transitions. [2019-12-27 12:42:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 12:42:24,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:24,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:24,308 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:24,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1009148223, now seen corresponding path program 1 times [2019-12-27 12:42:24,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:24,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777264257] [2019-12-27 12:42:24,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:24,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777264257] [2019-12-27 12:42:24,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:24,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:42:24,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041505413] [2019-12-27 12:42:24,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:42:24,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:24,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:42:24,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:42:24,362 INFO L87 Difference]: Start difference. First operand 4234 states and 9647 transitions. Second operand 3 states. [2019-12-27 12:42:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:24,560 INFO L93 Difference]: Finished difference Result 5804 states and 12895 transitions. [2019-12-27 12:42:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:42:24,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 12:42:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:24,569 INFO L225 Difference]: With dead ends: 5804 [2019-12-27 12:42:24,569 INFO L226 Difference]: Without dead ends: 5513 [2019-12-27 12:42:24,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:42:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2019-12-27 12:42:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5040. [2019-12-27 12:42:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5040 states. [2019-12-27 12:42:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5040 states to 5040 states and 11341 transitions. [2019-12-27 12:42:24,671 INFO L78 Accepts]: Start accepts. Automaton has 5040 states and 11341 transitions. Word has length 94 [2019-12-27 12:42:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:24,672 INFO L462 AbstractCegarLoop]: Abstraction has 5040 states and 11341 transitions. [2019-12-27 12:42:24,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:42:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5040 states and 11341 transitions. [2019-12-27 12:42:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 12:42:24,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:24,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:24,683 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:24,684 INFO L82 PathProgramCache]: Analyzing trace with hash -725997759, now seen corresponding path program 1 times [2019-12-27 12:42:24,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:24,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461170981] [2019-12-27 12:42:24,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:24,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461170981] [2019-12-27 12:42:24,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:24,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:42:24,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082965866] [2019-12-27 12:42:24,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:42:24,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:24,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:42:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:42:24,831 INFO L87 Difference]: Start difference. First operand 5040 states and 11341 transitions. Second operand 4 states. [2019-12-27 12:42:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:24,946 INFO L93 Difference]: Finished difference Result 5316 states and 12003 transitions. [2019-12-27 12:42:24,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:42:24,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-27 12:42:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:24,955 INFO L225 Difference]: With dead ends: 5316 [2019-12-27 12:42:24,955 INFO L226 Difference]: Without dead ends: 5316 [2019-12-27 12:42:24,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2019-12-27 12:42:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4773. [2019-12-27 12:42:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4773 states. [2019-12-27 12:42:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 10838 transitions. [2019-12-27 12:42:25,034 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 10838 transitions. Word has length 94 [2019-12-27 12:42:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:25,034 INFO L462 AbstractCegarLoop]: Abstraction has 4773 states and 10838 transitions. [2019-12-27 12:42:25,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:42:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 10838 transitions. [2019-12-27 12:42:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 12:42:25,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:25,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:25,041 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:25,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash 574359335, now seen corresponding path program 1 times [2019-12-27 12:42:25,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:25,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691449901] [2019-12-27 12:42:25,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:25,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691449901] [2019-12-27 12:42:25,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:25,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:42:25,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780066716] [2019-12-27 12:42:25,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:42:25,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:25,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:42:25,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:25,169 INFO L87 Difference]: Start difference. First operand 4773 states and 10838 transitions. Second operand 5 states. [2019-12-27 12:42:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:25,276 INFO L93 Difference]: Finished difference Result 5452 states and 12346 transitions. [2019-12-27 12:42:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:42:25,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-27 12:42:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:25,282 INFO L225 Difference]: With dead ends: 5452 [2019-12-27 12:42:25,283 INFO L226 Difference]: Without dead ends: 5452 [2019-12-27 12:42:25,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:42:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-27 12:42:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4174. [2019-12-27 12:42:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-27 12:42:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9445 transitions. [2019-12-27 12:42:25,329 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 9445 transitions. Word has length 96 [2019-12-27 12:42:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:25,329 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 9445 transitions. [2019-12-27 12:42:25,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:42:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 9445 transitions. [2019-12-27 12:42:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 12:42:25,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:25,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:25,334 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:25,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:25,334 INFO L82 PathProgramCache]: Analyzing trace with hash 585675462, now seen corresponding path program 1 times [2019-12-27 12:42:25,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:25,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210711619] [2019-12-27 12:42:25,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:25,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210711619] [2019-12-27 12:42:25,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:25,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:42:25,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674572631] [2019-12-27 12:42:25,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:42:25,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:25,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:42:25,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:42:25,407 INFO L87 Difference]: Start difference. First operand 4174 states and 9445 transitions. Second operand 4 states. [2019-12-27 12:42:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:25,689 INFO L93 Difference]: Finished difference Result 4884 states and 10994 transitions. [2019-12-27 12:42:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:42:25,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-27 12:42:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:25,697 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 12:42:25,697 INFO L226 Difference]: Without dead ends: 4828 [2019-12-27 12:42:25,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:42:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2019-12-27 12:42:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4625. [2019-12-27 12:42:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-27 12:42:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 10444 transitions. [2019-12-27 12:42:25,771 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 10444 transitions. Word has length 96 [2019-12-27 12:42:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:25,771 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 10444 transitions. [2019-12-27 12:42:25,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:42:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 10444 transitions. [2019-12-27 12:42:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 12:42:25,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:25,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:25,778 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1491533881, now seen corresponding path program 1 times [2019-12-27 12:42:25,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:25,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026955784] [2019-12-27 12:42:25,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:25,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026955784] [2019-12-27 12:42:25,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:25,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 12:42:25,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958754842] [2019-12-27 12:42:25,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 12:42:25,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:25,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 12:42:25,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:42:25,939 INFO L87 Difference]: Start difference. First operand 4625 states and 10444 transitions. Second operand 9 states. [2019-12-27 12:42:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:26,685 INFO L93 Difference]: Finished difference Result 6285 states and 13941 transitions. [2019-12-27 12:42:26,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 12:42:26,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 12:42:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:26,694 INFO L225 Difference]: With dead ends: 6285 [2019-12-27 12:42:26,694 INFO L226 Difference]: Without dead ends: 6285 [2019-12-27 12:42:26,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-27 12:42:26,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2019-12-27 12:42:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 5107. [2019-12-27 12:42:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2019-12-27 12:42:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 11442 transitions. [2019-12-27 12:42:26,751 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 11442 transitions. Word has length 96 [2019-12-27 12:42:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:26,751 INFO L462 AbstractCegarLoop]: Abstraction has 5107 states and 11442 transitions. [2019-12-27 12:42:26,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 12:42:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 11442 transitions. [2019-12-27 12:42:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 12:42:26,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:26,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:26,757 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:26,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:26,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1280182968, now seen corresponding path program 1 times [2019-12-27 12:42:26,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:26,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959270640] [2019-12-27 12:42:26,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:26,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959270640] [2019-12-27 12:42:26,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:26,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 12:42:26,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718866902] [2019-12-27 12:42:26,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 12:42:26,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 12:42:26,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:42:26,927 INFO L87 Difference]: Start difference. First operand 5107 states and 11442 transitions. Second operand 9 states. [2019-12-27 12:42:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:27,488 INFO L93 Difference]: Finished difference Result 6373 states and 14097 transitions. [2019-12-27 12:42:27,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 12:42:27,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 12:42:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:27,496 INFO L225 Difference]: With dead ends: 6373 [2019-12-27 12:42:27,496 INFO L226 Difference]: Without dead ends: 6355 [2019-12-27 12:42:27,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-27 12:42:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-12-27 12:42:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5470. [2019-12-27 12:42:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-12-27 12:42:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 12131 transitions. [2019-12-27 12:42:27,548 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 12131 transitions. Word has length 96 [2019-12-27 12:42:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:27,549 INFO L462 AbstractCegarLoop]: Abstraction has 5470 states and 12131 transitions. [2019-12-27 12:42:27,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 12:42:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 12131 transitions. [2019-12-27 12:42:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 12:42:27,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:27,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:27,556 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:27,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash -392679287, now seen corresponding path program 1 times [2019-12-27 12:42:27,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:27,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264141518] [2019-12-27 12:42:27,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:42:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:42:27,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264141518] [2019-12-27 12:42:27,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:42:27,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 12:42:27,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549634996] [2019-12-27 12:42:27,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 12:42:27,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:42:27,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 12:42:27,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:42:27,702 INFO L87 Difference]: Start difference. First operand 5470 states and 12131 transitions. Second operand 10 states. [2019-12-27 12:42:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:42:28,233 INFO L93 Difference]: Finished difference Result 17542 states and 39329 transitions. [2019-12-27 12:42:28,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 12:42:28,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 12:42:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:42:28,253 INFO L225 Difference]: With dead ends: 17542 [2019-12-27 12:42:28,253 INFO L226 Difference]: Without dead ends: 11338 [2019-12-27 12:42:28,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 12:42:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11338 states. [2019-12-27 12:42:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11338 to 5429. [2019-12-27 12:42:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2019-12-27 12:42:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 11955 transitions. [2019-12-27 12:42:28,404 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 11955 transitions. Word has length 96 [2019-12-27 12:42:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:42:28,405 INFO L462 AbstractCegarLoop]: Abstraction has 5429 states and 11955 transitions. [2019-12-27 12:42:28,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 12:42:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 11955 transitions. [2019-12-27 12:42:28,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 12:42:28,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:42:28,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:42:28,416 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:42:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:42:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash -325970013, now seen corresponding path program 2 times [2019-12-27 12:42:28,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:42:28,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335257784] [2019-12-27 12:42:28,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:42:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:42:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:42:28,581 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 12:42:28,582 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 12:42:28,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:42:28 BasicIcfg [2019-12-27 12:42:28,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 12:42:28,847 INFO L168 Benchmark]: Toolchain (without parser) took 50474.90 ms. Allocated memory was 137.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 100.7 MB in the beginning and 1.0 GB in the end (delta: -928.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 12:42:28,847 INFO L168 Benchmark]: CDTParser took 1.73 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 12:42:28,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.27 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 154.8 MB in the end (delta: -54.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 12:42:28,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.20 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 12:42:28,854 INFO L168 Benchmark]: Boogie Preprocessor took 37.00 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 12:42:28,854 INFO L168 Benchmark]: RCFGBuilder took 781.48 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 106.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 12:42:28,855 INFO L168 Benchmark]: TraceAbstraction took 48845.64 ms. Allocated memory was 201.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.2 MB in the beginning and 1.0 GB in the end (delta: -923.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 12:42:28,863 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.73 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 740.27 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 154.8 MB in the end (delta: -54.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.20 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.00 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.48 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 106.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48845.64 ms. Allocated memory was 201.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.2 MB in the beginning and 1.0 GB in the end (delta: -923.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1549; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 pthread_t t1550; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] FCALL, FORK 0 pthread_create(&t1550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L809] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.3s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7834 SDtfs, 8908 SDslu, 18012 SDs, 0 SdLazy, 6883 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 77 SyntacticMatches, 18 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 86547 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1997 NumberOfCodeBlocks, 1997 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1873 ConstructedInterpolants, 0 QuantifiedInterpolants, 364447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...