/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/mix012_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 00:42:57,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 00:42:57,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 00:42:57,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 00:42:57,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 00:42:57,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 00:42:57,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 00:42:57,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 00:42:57,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 00:42:57,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 00:42:57,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 00:42:57,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 00:42:57,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 00:42:57,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 00:42:57,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 00:42:57,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 00:42:57,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 00:42:57,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 00:42:57,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 00:42:57,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 00:42:57,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 00:42:57,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 00:42:57,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 00:42:57,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 00:42:57,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 00:42:57,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 00:42:57,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 00:42:57,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 00:42:57,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 00:42:57,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 00:42:57,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 00:42:57,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 00:42:57,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 00:42:57,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 00:42:57,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 00:42:57,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 00:42:57,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 00:42:57,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 00:42:57,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 00:42:57,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 00:42:57,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 00:42:57,377 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-19 00:42:57,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 00:42:57,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 00:42:57,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 00:42:57,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 00:42:57,402 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 00:42:57,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 00:42:57,405 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 00:42:57,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 00:42:57,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 00:42:57,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 00:42:57,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 00:42:57,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 00:42:57,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 00:42:57,407 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 00:42:57,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 00:42:57,407 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 00:42:57,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 00:42:57,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 00:42:57,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 00:42:57,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 00:42:57,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 00:42:57,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 00:42:57,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 00:42:57,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 00:42:57,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 00:42:57,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 00:42:57,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 00:42:57,410 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 00:42:57,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 00:42:57,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 00:42:57,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 00:42:57,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 00:42:57,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 00:42:57,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 00:42:57,697 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 00:42:57,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i [2019-12-19 00:42:57,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a90f96444/289044a0a7ad417e9f0bb9775f20f9b0/FLAGccf6f81b5 [2019-12-19 00:42:58,340 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 00:42:58,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i [2019-12-19 00:42:58,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a90f96444/289044a0a7ad417e9f0bb9775f20f9b0/FLAGccf6f81b5 [2019-12-19 00:42:58,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a90f96444/289044a0a7ad417e9f0bb9775f20f9b0 [2019-12-19 00:42:58,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 00:42:58,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 00:42:58,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 00:42:58,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 00:42:58,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 00:42:58,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:42:58" (1/1) ... [2019-12-19 00:42:58,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d76d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:58, skipping insertion in model container [2019-12-19 00:42:58,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:42:58" (1/1) ... [2019-12-19 00:42:58,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 00:42:58,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 00:42:59,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:42:59,303 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 00:42:59,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:42:59,465 INFO L208 MainTranslator]: Completed translation [2019-12-19 00:42:59,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59 WrapperNode [2019-12-19 00:42:59,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 00:42:59,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 00:42:59,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 00:42:59,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 00:42:59,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (1/1) ... [2019-12-19 00:42:59,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (1/1) ... [2019-12-19 00:42:59,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 00:42:59,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 00:42:59,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 00:42:59,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 00:42:59,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (1/1) ... [2019-12-19 00:42:59,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (1/1) ... [2019-12-19 00:42:59,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (1/1) ... [2019-12-19 00:42:59,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (1/1) ... [2019-12-19 00:42:59,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (1/1) ... [2019-12-19 00:42:59,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (1/1) ... [2019-12-19 00:42:59,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (1/1) ... [2019-12-19 00:42:59,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 00:42:59,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 00:42:59,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 00:42:59,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 00:42:59,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (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-19 00:42:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 00:42:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 00:42:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 00:42:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 00:42:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 00:42:59,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 00:42:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 00:42:59,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 00:42:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 00:42:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 00:42:59,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 00:42:59,636 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 00:43:00,270 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 00:43:00,270 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 00:43:00,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:43:00 BoogieIcfgContainer [2019-12-19 00:43:00,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 00:43:00,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 00:43:00,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 00:43:00,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 00:43:00,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:42:58" (1/3) ... [2019-12-19 00:43:00,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6652ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:43:00, skipping insertion in model container [2019-12-19 00:43:00,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:59" (2/3) ... [2019-12-19 00:43:00,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6652ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:43:00, skipping insertion in model container [2019-12-19 00:43:00,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:43:00" (3/3) ... [2019-12-19 00:43:00,283 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc.i [2019-12-19 00:43:00,294 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 00:43:00,295 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 00:43:00,310 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 00:43:00,311 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 00:43:00,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,465 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,468 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:43:00,486 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 00:43:00,508 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 00:43:00,508 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 00:43:00,508 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 00:43:00,509 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 00:43:00,509 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 00:43:00,509 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 00:43:00,509 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 00:43:00,509 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 00:43:00,522 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-19 00:43:02,463 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-12-19 00:43:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-12-19 00:43:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-19 00:43:02,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:02,472 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] [2019-12-19 00:43:02,473 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1564572936, now seen corresponding path program 1 times [2019-12-19 00:43:02,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:02,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301523200] [2019-12-19 00:43:02,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:02,831 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-19 00:43:02,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301523200] [2019-12-19 00:43:02,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:02,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:43:02,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161264395] [2019-12-19 00:43:02,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:43:02,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:43:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:43:02,865 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-12-19 00:43:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:04,443 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-12-19 00:43:04,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:43:04,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-19 00:43:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:04,683 INFO L225 Difference]: With dead ends: 33592 [2019-12-19 00:43:04,683 INFO L226 Difference]: Without dead ends: 25704 [2019-12-19 00:43:04,685 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-19 00:43:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-12-19 00:43:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-12-19 00:43:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-12-19 00:43:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-12-19 00:43:07,030 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-12-19 00:43:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:07,031 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-12-19 00:43:07,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:43:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-12-19 00:43:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 00:43:07,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:07,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] [2019-12-19 00:43:07,050 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1980442200, now seen corresponding path program 1 times [2019-12-19 00:43:07,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:07,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192784225] [2019-12-19 00:43:07,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:07,229 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-19 00:43:07,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192784225] [2019-12-19 00:43:07,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:07,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:43:07,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025282846] [2019-12-19 00:43:07,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:43:07,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:07,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:43:07,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:43:07,233 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-12-19 00:43:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:08,111 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-12-19 00:43:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:43:08,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 00:43:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:08,273 INFO L225 Difference]: With dead ends: 41082 [2019-12-19 00:43:08,273 INFO L226 Difference]: Without dead ends: 40546 [2019-12-19 00:43:08,274 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-19 00:43:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-12-19 00:43:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-12-19 00:43:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-12-19 00:43:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-12-19 00:43:10,764 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-12-19 00:43:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:10,766 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-12-19 00:43:10,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:43:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-12-19 00:43:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 00:43:10,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:10,773 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] [2019-12-19 00:43:10,773 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:10,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:10,773 INFO L82 PathProgramCache]: Analyzing trace with hash 645631914, now seen corresponding path program 1 times [2019-12-19 00:43:10,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:10,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645546177] [2019-12-19 00:43:10,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:10,860 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-19 00:43:10,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645546177] [2019-12-19 00:43:10,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:10,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:43:10,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386411727] [2019-12-19 00:43:10,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:43:10,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:10,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:43:10,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:43:10,863 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-12-19 00:43:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:11,752 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-12-19 00:43:11,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:43:11,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 00:43:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:11,907 INFO L225 Difference]: With dead ends: 49779 [2019-12-19 00:43:11,907 INFO L226 Difference]: Without dead ends: 49275 [2019-12-19 00:43:11,907 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-19 00:43:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-12-19 00:43:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-12-19 00:43:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-12-19 00:43:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-12-19 00:43:14,750 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-12-19 00:43:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:14,751 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-12-19 00:43:14,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:43:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-12-19 00:43:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 00:43:14,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:14,760 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] [2019-12-19 00:43:14,761 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1346758064, now seen corresponding path program 1 times [2019-12-19 00:43:14,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:14,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682263382] [2019-12-19 00:43:14,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:14,854 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-19 00:43:14,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682263382] [2019-12-19 00:43:14,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:14,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:43:14,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322485356] [2019-12-19 00:43:14,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:43:14,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:43:14,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:43:14,858 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-12-19 00:43:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:15,498 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-12-19 00:43:15,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:43:15,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-19 00:43:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:15,640 INFO L225 Difference]: With dead ends: 61088 [2019-12-19 00:43:15,640 INFO L226 Difference]: Without dead ends: 61088 [2019-12-19 00:43:15,641 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-19 00:43:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-12-19 00:43:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-12-19 00:43:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-12-19 00:43:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-12-19 00:43:18,521 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-12-19 00:43:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:18,522 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-12-19 00:43:18,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:43:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-12-19 00:43:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:43:18,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:18,536 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-19 00:43:18,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash 551995902, now seen corresponding path program 1 times [2019-12-19 00:43:18,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:18,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223638137] [2019-12-19 00:43:18,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:18,596 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-19 00:43:18,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223638137] [2019-12-19 00:43:18,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:18,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:43:18,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315023937] [2019-12-19 00:43:18,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:43:18,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:18,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:43:18,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:43:18,598 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 3 states. [2019-12-19 00:43:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:19,056 INFO L93 Difference]: Finished difference Result 53337 states and 193528 transitions. [2019-12-19 00:43:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:43:19,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-19 00:43:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:19,174 INFO L225 Difference]: With dead ends: 53337 [2019-12-19 00:43:19,174 INFO L226 Difference]: Without dead ends: 53337 [2019-12-19 00:43:19,175 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-19 00:43:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53337 states. [2019-12-19 00:43:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53337 to 50675. [2019-12-19 00:43:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50675 states. [2019-12-19 00:43:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50675 states to 50675 states and 183848 transitions. [2019-12-19 00:43:22,905 INFO L78 Accepts]: Start accepts. Automaton has 50675 states and 183848 transitions. Word has length 54 [2019-12-19 00:43:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:22,906 INFO L462 AbstractCegarLoop]: Abstraction has 50675 states and 183848 transitions. [2019-12-19 00:43:22,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:43:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 50675 states and 183848 transitions. [2019-12-19 00:43:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:43:22,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:22,916 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-19 00:43:22,916 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -962055554, now seen corresponding path program 1 times [2019-12-19 00:43:22,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:22,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499178927] [2019-12-19 00:43:22,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:23,055 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-19 00:43:23,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499178927] [2019-12-19 00:43:23,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:23,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:43:23,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021161555] [2019-12-19 00:43:23,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:43:23,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:43:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:43:23,059 INFO L87 Difference]: Start difference. First operand 50675 states and 183848 transitions. Second operand 6 states. [2019-12-19 00:43:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:23,939 INFO L93 Difference]: Finished difference Result 65267 states and 234906 transitions. [2019-12-19 00:43:23,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:43:23,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 00:43:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:24,078 INFO L225 Difference]: With dead ends: 65267 [2019-12-19 00:43:24,079 INFO L226 Difference]: Without dead ends: 65267 [2019-12-19 00:43:24,079 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-19 00:43:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65267 states. [2019-12-19 00:43:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65267 to 59950. [2019-12-19 00:43:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-12-19 00:43:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-12-19 00:43:25,494 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-12-19 00:43:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:25,495 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-12-19 00:43:25,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:43:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-12-19 00:43:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:43:25,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:25,507 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-19 00:43:25,507 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:25,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:25,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1535960383, now seen corresponding path program 1 times [2019-12-19 00:43:25,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:25,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541443826] [2019-12-19 00:43:25,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:25,615 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-19 00:43:25,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541443826] [2019-12-19 00:43:25,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:25,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:43:25,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491289963] [2019-12-19 00:43:25,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:43:25,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:43:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:43:25,617 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 7 states. [2019-12-19 00:43:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:27,498 INFO L93 Difference]: Finished difference Result 83686 states and 290098 transitions. [2019-12-19 00:43:27,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:43:27,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-19 00:43:27,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:27,673 INFO L225 Difference]: With dead ends: 83686 [2019-12-19 00:43:27,674 INFO L226 Difference]: Without dead ends: 83686 [2019-12-19 00:43:27,674 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-19 00:43:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83686 states. [2019-12-19 00:43:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83686 to 71013. [2019-12-19 00:43:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71013 states. [2019-12-19 00:43:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71013 states to 71013 states and 249887 transitions. [2019-12-19 00:43:31,447 INFO L78 Accepts]: Start accepts. Automaton has 71013 states and 249887 transitions. Word has length 54 [2019-12-19 00:43:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:31,448 INFO L462 AbstractCegarLoop]: Abstraction has 71013 states and 249887 transitions. [2019-12-19 00:43:31,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:43:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 71013 states and 249887 transitions. [2019-12-19 00:43:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:43:31,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:31,461 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-19 00:43:31,462 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:31,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1871503232, now seen corresponding path program 1 times [2019-12-19 00:43:31,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:31,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684832470] [2019-12-19 00:43:31,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:31,544 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-19 00:43:31,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684832470] [2019-12-19 00:43:31,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:31,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:43:31,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105860893] [2019-12-19 00:43:31,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:43:31,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:43:31,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:43:31,546 INFO L87 Difference]: Start difference. First operand 71013 states and 249887 transitions. Second operand 4 states. [2019-12-19 00:43:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:31,610 INFO L93 Difference]: Finished difference Result 12160 states and 37830 transitions. [2019-12-19 00:43:31,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:43:31,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-19 00:43:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:31,628 INFO L225 Difference]: With dead ends: 12160 [2019-12-19 00:43:31,628 INFO L226 Difference]: Without dead ends: 10675 [2019-12-19 00:43:31,628 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-19 00:43:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10675 states. [2019-12-19 00:43:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10675 to 10626. [2019-12-19 00:43:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10626 states. [2019-12-19 00:43:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10626 states to 10626 states and 32592 transitions. [2019-12-19 00:43:31,772 INFO L78 Accepts]: Start accepts. Automaton has 10626 states and 32592 transitions. Word has length 54 [2019-12-19 00:43:31,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:31,772 INFO L462 AbstractCegarLoop]: Abstraction has 10626 states and 32592 transitions. [2019-12-19 00:43:31,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:43:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 10626 states and 32592 transitions. [2019-12-19 00:43:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:43:31,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:31,774 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-19 00:43:31,774 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:31,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:31,774 INFO L82 PathProgramCache]: Analyzing trace with hash 683903899, now seen corresponding path program 1 times [2019-12-19 00:43:31,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:31,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797849670] [2019-12-19 00:43:31,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:31,858 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-19 00:43:31,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797849670] [2019-12-19 00:43:31,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:31,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:43:31,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789910528] [2019-12-19 00:43:31,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:43:31,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:31,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:43:31,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:43:31,861 INFO L87 Difference]: Start difference. First operand 10626 states and 32592 transitions. Second operand 6 states. [2019-12-19 00:43:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:32,810 INFO L93 Difference]: Finished difference Result 13183 states and 39873 transitions. [2019-12-19 00:43:32,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:43:32,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 00:43:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:32,836 INFO L225 Difference]: With dead ends: 13183 [2019-12-19 00:43:32,837 INFO L226 Difference]: Without dead ends: 13120 [2019-12-19 00:43:32,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 00:43:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-12-19 00:43:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 11049. [2019-12-19 00:43:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11049 states. [2019-12-19 00:43:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11049 states to 11049 states and 33786 transitions. [2019-12-19 00:43:32,988 INFO L78 Accepts]: Start accepts. Automaton has 11049 states and 33786 transitions. Word has length 54 [2019-12-19 00:43:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:32,988 INFO L462 AbstractCegarLoop]: Abstraction has 11049 states and 33786 transitions. [2019-12-19 00:43:32,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:43:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 11049 states and 33786 transitions. [2019-12-19 00:43:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 00:43:32,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:43:32,992 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1727879850, now seen corresponding path program 1 times [2019-12-19 00:43:32,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:32,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117476763] [2019-12-19 00:43:32,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:33,099 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-19 00:43:33,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117476763] [2019-12-19 00:43:33,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:33,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:43:33,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300932238] [2019-12-19 00:43:33,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:43:33,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:33,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:43:33,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:43:33,102 INFO L87 Difference]: Start difference. First operand 11049 states and 33786 transitions. Second operand 6 states. [2019-12-19 00:43:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:33,580 INFO L93 Difference]: Finished difference Result 13540 states and 40805 transitions. [2019-12-19 00:43:33,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:43:33,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-19 00:43:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:33,608 INFO L225 Difference]: With dead ends: 13540 [2019-12-19 00:43:33,609 INFO L226 Difference]: Without dead ends: 13479 [2019-12-19 00:43:33,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:43:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13479 states. [2019-12-19 00:43:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13479 to 12787. [2019-12-19 00:43:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12787 states. [2019-12-19 00:43:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12787 states to 12787 states and 38735 transitions. [2019-12-19 00:43:33,806 INFO L78 Accepts]: Start accepts. Automaton has 12787 states and 38735 transitions. Word has length 62 [2019-12-19 00:43:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:33,806 INFO L462 AbstractCegarLoop]: Abstraction has 12787 states and 38735 transitions. [2019-12-19 00:43:33,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:43:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 12787 states and 38735 transitions. [2019-12-19 00:43:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 00:43:33,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:33,814 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] [2019-12-19 00:43:33,815 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:33,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:33,815 INFO L82 PathProgramCache]: Analyzing trace with hash -903159920, now seen corresponding path program 1 times [2019-12-19 00:43:33,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:33,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015367578] [2019-12-19 00:43:33,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:33,871 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-19 00:43:33,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015367578] [2019-12-19 00:43:33,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:33,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:43:33,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324331185] [2019-12-19 00:43:33,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:43:33,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:33,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:43:33,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:43:33,874 INFO L87 Difference]: Start difference. First operand 12787 states and 38735 transitions. Second operand 4 states. [2019-12-19 00:43:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:34,198 INFO L93 Difference]: Finished difference Result 15674 states and 46880 transitions. [2019-12-19 00:43:34,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:43:34,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 00:43:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:34,220 INFO L225 Difference]: With dead ends: 15674 [2019-12-19 00:43:34,220 INFO L226 Difference]: Without dead ends: 15674 [2019-12-19 00:43:34,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:43:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15674 states. [2019-12-19 00:43:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15674 to 14153. [2019-12-19 00:43:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14153 states. [2019-12-19 00:43:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14153 states to 14153 states and 42469 transitions. [2019-12-19 00:43:34,402 INFO L78 Accepts]: Start accepts. Automaton has 14153 states and 42469 transitions. Word has length 66 [2019-12-19 00:43:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:34,402 INFO L462 AbstractCegarLoop]: Abstraction has 14153 states and 42469 transitions. [2019-12-19 00:43:34,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:43:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 14153 states and 42469 transitions. [2019-12-19 00:43:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 00:43:34,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:34,409 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] [2019-12-19 00:43:34,409 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1314598033, now seen corresponding path program 1 times [2019-12-19 00:43:34,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:34,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203163643] [2019-12-19 00:43:34,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:34,465 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-19 00:43:34,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203163643] [2019-12-19 00:43:34,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:34,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:43:34,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000121741] [2019-12-19 00:43:34,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:43:34,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:43:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:43:34,467 INFO L87 Difference]: Start difference. First operand 14153 states and 42469 transitions. Second operand 3 states. [2019-12-19 00:43:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:34,716 INFO L93 Difference]: Finished difference Result 14686 states and 43876 transitions. [2019-12-19 00:43:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:43:34,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-19 00:43:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:34,743 INFO L225 Difference]: With dead ends: 14686 [2019-12-19 00:43:34,743 INFO L226 Difference]: Without dead ends: 14686 [2019-12-19 00:43:34,743 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-19 00:43:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14686 states. [2019-12-19 00:43:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14686 to 14437. [2019-12-19 00:43:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14437 states. [2019-12-19 00:43:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14437 states to 14437 states and 43213 transitions. [2019-12-19 00:43:35,308 INFO L78 Accepts]: Start accepts. Automaton has 14437 states and 43213 transitions. Word has length 66 [2019-12-19 00:43:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:35,308 INFO L462 AbstractCegarLoop]: Abstraction has 14437 states and 43213 transitions. [2019-12-19 00:43:35,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:43:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 14437 states and 43213 transitions. [2019-12-19 00:43:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:43:35,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:35,319 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] [2019-12-19 00:43:35,319 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash 789260736, now seen corresponding path program 1 times [2019-12-19 00:43:35,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:35,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405937685] [2019-12-19 00:43:35,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:35,407 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-19 00:43:35,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405937685] [2019-12-19 00:43:35,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:35,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:43:35,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792776712] [2019-12-19 00:43:35,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:43:35,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:35,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:43:35,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:43:35,410 INFO L87 Difference]: Start difference. First operand 14437 states and 43213 transitions. Second operand 6 states. [2019-12-19 00:43:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:35,995 INFO L93 Difference]: Finished difference Result 15429 states and 45576 transitions. [2019-12-19 00:43:35,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:43:35,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 00:43:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:36,016 INFO L225 Difference]: With dead ends: 15429 [2019-12-19 00:43:36,017 INFO L226 Difference]: Without dead ends: 15429 [2019-12-19 00:43:36,017 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-19 00:43:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2019-12-19 00:43:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 15010. [2019-12-19 00:43:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15010 states. [2019-12-19 00:43:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15010 states to 15010 states and 44510 transitions. [2019-12-19 00:43:36,213 INFO L78 Accepts]: Start accepts. Automaton has 15010 states and 44510 transitions. Word has length 68 [2019-12-19 00:43:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:36,214 INFO L462 AbstractCegarLoop]: Abstraction has 15010 states and 44510 transitions. [2019-12-19 00:43:36,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:43:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 15010 states and 44510 transitions. [2019-12-19 00:43:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:43:36,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:36,223 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] [2019-12-19 00:43:36,223 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1287948607, now seen corresponding path program 1 times [2019-12-19 00:43:36,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:36,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866743064] [2019-12-19 00:43:36,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:36,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-19 00:43:36,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866743064] [2019-12-19 00:43:36,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:36,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:43:36,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451845197] [2019-12-19 00:43:36,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:43:36,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:43:36,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:43:36,341 INFO L87 Difference]: Start difference. First operand 15010 states and 44510 transitions. Second operand 6 states. [2019-12-19 00:43:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:36,826 INFO L93 Difference]: Finished difference Result 17281 states and 49779 transitions. [2019-12-19 00:43:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:43:36,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 00:43:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:36,851 INFO L225 Difference]: With dead ends: 17281 [2019-12-19 00:43:36,851 INFO L226 Difference]: Without dead ends: 17281 [2019-12-19 00:43:36,851 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-19 00:43:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17281 states. [2019-12-19 00:43:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17281 to 15702. [2019-12-19 00:43:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15702 states. [2019-12-19 00:43:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15702 states to 15702 states and 45760 transitions. [2019-12-19 00:43:37,060 INFO L78 Accepts]: Start accepts. Automaton has 15702 states and 45760 transitions. Word has length 68 [2019-12-19 00:43:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:37,060 INFO L462 AbstractCegarLoop]: Abstraction has 15702 states and 45760 transitions. [2019-12-19 00:43:37,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:43:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 15702 states and 45760 transitions. [2019-12-19 00:43:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:43:37,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:37,070 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] [2019-12-19 00:43:37,070 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:37,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:37,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1076597694, now seen corresponding path program 1 times [2019-12-19 00:43:37,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:37,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587811946] [2019-12-19 00:43:37,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:37,139 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-19 00:43:37,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587811946] [2019-12-19 00:43:37,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:37,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:43:37,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894721383] [2019-12-19 00:43:37,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:43:37,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:37,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:43:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:43:37,141 INFO L87 Difference]: Start difference. First operand 15702 states and 45760 transitions. Second operand 5 states. [2019-12-19 00:43:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:37,539 INFO L93 Difference]: Finished difference Result 20231 states and 58824 transitions. [2019-12-19 00:43:37,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:43:37,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 00:43:37,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:37,566 INFO L225 Difference]: With dead ends: 20231 [2019-12-19 00:43:37,567 INFO L226 Difference]: Without dead ends: 20231 [2019-12-19 00:43:37,567 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-19 00:43:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20231 states. [2019-12-19 00:43:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20231 to 18521. [2019-12-19 00:43:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18521 states. [2019-12-19 00:43:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18521 states to 18521 states and 53710 transitions. [2019-12-19 00:43:38,206 INFO L78 Accepts]: Start accepts. Automaton has 18521 states and 53710 transitions. Word has length 68 [2019-12-19 00:43:38,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:38,206 INFO L462 AbstractCegarLoop]: Abstraction has 18521 states and 53710 transitions. [2019-12-19 00:43:38,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:43:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 18521 states and 53710 transitions. [2019-12-19 00:43:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:43:38,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:38,218 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] [2019-12-19 00:43:38,218 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1587131871, now seen corresponding path program 1 times [2019-12-19 00:43:38,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:38,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826723598] [2019-12-19 00:43:38,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:38,282 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-19 00:43:38,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826723598] [2019-12-19 00:43:38,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:38,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:43:38,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777351244] [2019-12-19 00:43:38,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:43:38,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:38,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:43:38,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:43:38,286 INFO L87 Difference]: Start difference. First operand 18521 states and 53710 transitions. Second operand 5 states. [2019-12-19 00:43:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:38,881 INFO L93 Difference]: Finished difference Result 25228 states and 72837 transitions. [2019-12-19 00:43:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:43:38,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 00:43:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:38,920 INFO L225 Difference]: With dead ends: 25228 [2019-12-19 00:43:38,920 INFO L226 Difference]: Without dead ends: 25228 [2019-12-19 00:43:38,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:43:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25228 states. [2019-12-19 00:43:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25228 to 20409. [2019-12-19 00:43:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20409 states. [2019-12-19 00:43:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20409 states to 20409 states and 58984 transitions. [2019-12-19 00:43:39,223 INFO L78 Accepts]: Start accepts. Automaton has 20409 states and 58984 transitions. Word has length 68 [2019-12-19 00:43:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:39,223 INFO L462 AbstractCegarLoop]: Abstraction has 20409 states and 58984 transitions. [2019-12-19 00:43:39,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:43:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 20409 states and 58984 transitions. [2019-12-19 00:43:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:43:39,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:39,233 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] [2019-12-19 00:43:39,233 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash 900380962, now seen corresponding path program 1 times [2019-12-19 00:43:39,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:39,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128925176] [2019-12-19 00:43:39,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:39,325 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-19 00:43:39,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128925176] [2019-12-19 00:43:39,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:39,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:43:39,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426157146] [2019-12-19 00:43:39,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:43:39,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:43:39,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:43:39,327 INFO L87 Difference]: Start difference. First operand 20409 states and 58984 transitions. Second operand 6 states. [2019-12-19 00:43:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:40,531 INFO L93 Difference]: Finished difference Result 26880 states and 78478 transitions. [2019-12-19 00:43:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:43:40,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 00:43:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:40,589 INFO L225 Difference]: With dead ends: 26880 [2019-12-19 00:43:40,589 INFO L226 Difference]: Without dead ends: 26769 [2019-12-19 00:43:40,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:43:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26769 states. [2019-12-19 00:43:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26769 to 24702. [2019-12-19 00:43:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24702 states. [2019-12-19 00:43:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24702 states to 24702 states and 71782 transitions. [2019-12-19 00:43:41,755 INFO L78 Accepts]: Start accepts. Automaton has 24702 states and 71782 transitions. Word has length 68 [2019-12-19 00:43:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:41,756 INFO L462 AbstractCegarLoop]: Abstraction has 24702 states and 71782 transitions. [2019-12-19 00:43:41,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:43:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 24702 states and 71782 transitions. [2019-12-19 00:43:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:43:41,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:41,772 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] [2019-12-19 00:43:41,772 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash -896570397, now seen corresponding path program 1 times [2019-12-19 00:43:41,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:41,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663321979] [2019-12-19 00:43:41,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:42,008 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-19 00:43:42,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663321979] [2019-12-19 00:43:42,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:42,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 00:43:42,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007888726] [2019-12-19 00:43:42,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 00:43:42,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:42,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 00:43:42,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:43:42,016 INFO L87 Difference]: Start difference. First operand 24702 states and 71782 transitions. Second operand 9 states. [2019-12-19 00:43:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:42,831 INFO L93 Difference]: Finished difference Result 30982 states and 89506 transitions. [2019-12-19 00:43:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 00:43:42,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-19 00:43:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:42,873 INFO L225 Difference]: With dead ends: 30982 [2019-12-19 00:43:42,873 INFO L226 Difference]: Without dead ends: 30982 [2019-12-19 00:43:42,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:43:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30982 states. [2019-12-19 00:43:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30982 to 27343. [2019-12-19 00:43:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-19 00:43:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 79281 transitions. [2019-12-19 00:43:43,243 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 79281 transitions. Word has length 68 [2019-12-19 00:43:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:43,244 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 79281 transitions. [2019-12-19 00:43:43,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 00:43:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 79281 transitions. [2019-12-19 00:43:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:43:43,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:43,253 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] [2019-12-19 00:43:43,253 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash -9066716, now seen corresponding path program 1 times [2019-12-19 00:43:43,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:43,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844594144] [2019-12-19 00:43:43,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:43,322 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-19 00:43:43,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844594144] [2019-12-19 00:43:43,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:43,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:43:43,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858158183] [2019-12-19 00:43:43,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:43:43,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:43,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:43:43,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:43:43,324 INFO L87 Difference]: Start difference. First operand 27343 states and 79281 transitions. Second operand 5 states. [2019-12-19 00:43:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:43,378 INFO L93 Difference]: Finished difference Result 7438 states and 17579 transitions. [2019-12-19 00:43:43,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:43:43,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 00:43:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:43,386 INFO L225 Difference]: With dead ends: 7438 [2019-12-19 00:43:43,386 INFO L226 Difference]: Without dead ends: 6196 [2019-12-19 00:43:43,387 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-19 00:43:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2019-12-19 00:43:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 5051. [2019-12-19 00:43:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5051 states. [2019-12-19 00:43:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 11647 transitions. [2019-12-19 00:43:43,440 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 11647 transitions. Word has length 68 [2019-12-19 00:43:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:43,440 INFO L462 AbstractCegarLoop]: Abstraction has 5051 states and 11647 transitions. [2019-12-19 00:43:43,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:43:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 11647 transitions. [2019-12-19 00:43:43,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:43:43,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:43,443 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] [2019-12-19 00:43:43,443 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1271293831, now seen corresponding path program 1 times [2019-12-19 00:43:43,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:43,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325858500] [2019-12-19 00:43:43,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:43,481 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-19 00:43:43,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325858500] [2019-12-19 00:43:43,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:43,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:43:43,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587842692] [2019-12-19 00:43:43,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:43:43,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:43:43,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:43:43,484 INFO L87 Difference]: Start difference. First operand 5051 states and 11647 transitions. Second operand 3 states. [2019-12-19 00:43:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:43,520 INFO L93 Difference]: Finished difference Result 6708 states and 15325 transitions. [2019-12-19 00:43:43,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:43:43,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-19 00:43:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:43,529 INFO L225 Difference]: With dead ends: 6708 [2019-12-19 00:43:43,529 INFO L226 Difference]: Without dead ends: 6708 [2019-12-19 00:43:43,530 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-19 00:43:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2019-12-19 00:43:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 4999. [2019-12-19 00:43:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2019-12-19 00:43:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 11249 transitions. [2019-12-19 00:43:43,596 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 11249 transitions. Word has length 68 [2019-12-19 00:43:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:43,596 INFO L462 AbstractCegarLoop]: Abstraction has 4999 states and 11249 transitions. [2019-12-19 00:43:43,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:43:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 11249 transitions. [2019-12-19 00:43:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-19 00:43:43,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:43,600 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] [2019-12-19 00:43:43,600 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:43,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:43,601 INFO L82 PathProgramCache]: Analyzing trace with hash 186991737, now seen corresponding path program 1 times [2019-12-19 00:43:43,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:43,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180919230] [2019-12-19 00:43:43,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:43,661 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-19 00:43:43,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180919230] [2019-12-19 00:43:43,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:43,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:43:43,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665055538] [2019-12-19 00:43:43,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:43:43,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:43,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:43:43,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:43:43,664 INFO L87 Difference]: Start difference. First operand 4999 states and 11249 transitions. Second operand 7 states. [2019-12-19 00:43:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:44,456 INFO L93 Difference]: Finished difference Result 5810 states and 12970 transitions. [2019-12-19 00:43:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:43:44,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-19 00:43:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:44,463 INFO L225 Difference]: With dead ends: 5810 [2019-12-19 00:43:44,463 INFO L226 Difference]: Without dead ends: 5757 [2019-12-19 00:43:44,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 00:43:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-12-19 00:43:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5015. [2019-12-19 00:43:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5015 states. [2019-12-19 00:43:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 11212 transitions. [2019-12-19 00:43:44,512 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 11212 transitions. Word has length 74 [2019-12-19 00:43:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:44,513 INFO L462 AbstractCegarLoop]: Abstraction has 5015 states and 11212 transitions. [2019-12-19 00:43:44,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:43:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 11212 transitions. [2019-12-19 00:43:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 00:43:44,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:44,517 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] [2019-12-19 00:43:44,518 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:44,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:44,518 INFO L82 PathProgramCache]: Analyzing trace with hash 316232134, now seen corresponding path program 1 times [2019-12-19 00:43:44,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:44,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954086521] [2019-12-19 00:43:44,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:44,569 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-19 00:43:44,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954086521] [2019-12-19 00:43:44,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:44,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:43:44,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617532818] [2019-12-19 00:43:44,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:43:44,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:44,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:43:44,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:43:44,572 INFO L87 Difference]: Start difference. First operand 5015 states and 11212 transitions. Second operand 3 states. [2019-12-19 00:43:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:44,743 INFO L93 Difference]: Finished difference Result 6355 states and 13991 transitions. [2019-12-19 00:43:44,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:43:44,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-19 00:43:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:44,752 INFO L225 Difference]: With dead ends: 6355 [2019-12-19 00:43:44,752 INFO L226 Difference]: Without dead ends: 6355 [2019-12-19 00:43:44,752 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-19 00:43:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-12-19 00:43:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5918. [2019-12-19 00:43:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5918 states. [2019-12-19 00:43:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5918 states to 5918 states and 13072 transitions. [2019-12-19 00:43:44,815 INFO L78 Accepts]: Start accepts. Automaton has 5918 states and 13072 transitions. Word has length 93 [2019-12-19 00:43:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:44,815 INFO L462 AbstractCegarLoop]: Abstraction has 5918 states and 13072 transitions. [2019-12-19 00:43:44,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:43:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5918 states and 13072 transitions. [2019-12-19 00:43:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 00:43:44,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:44,821 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] [2019-12-19 00:43:44,821 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:44,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1415085423, now seen corresponding path program 1 times [2019-12-19 00:43:44,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:44,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296664140] [2019-12-19 00:43:44,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:44,887 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-19 00:43:44,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296664140] [2019-12-19 00:43:44,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:44,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:43:44,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632163228] [2019-12-19 00:43:44,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:43:44,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:44,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:43:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:43:44,889 INFO L87 Difference]: Start difference. First operand 5918 states and 13072 transitions. Second operand 4 states. [2019-12-19 00:43:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:44,993 INFO L93 Difference]: Finished difference Result 6314 states and 13994 transitions. [2019-12-19 00:43:44,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:43:44,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-19 00:43:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:45,000 INFO L225 Difference]: With dead ends: 6314 [2019-12-19 00:43:45,000 INFO L226 Difference]: Without dead ends: 6314 [2019-12-19 00:43:45,000 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-19 00:43:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-12-19 00:43:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 5757. [2019-12-19 00:43:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-12-19 00:43:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 12813 transitions. [2019-12-19 00:43:45,057 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 12813 transitions. Word has length 93 [2019-12-19 00:43:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:45,058 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 12813 transitions. [2019-12-19 00:43:45,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:43:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 12813 transitions. [2019-12-19 00:43:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:43:45,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:45,063 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] [2019-12-19 00:43:45,064 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:45,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1096662197, now seen corresponding path program 1 times [2019-12-19 00:43:45,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:45,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316843166] [2019-12-19 00:43:45,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:45,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-19 00:43:45,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316843166] [2019-12-19 00:43:45,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:45,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:43:45,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573165533] [2019-12-19 00:43:45,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:43:45,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:45,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:43:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:43:45,132 INFO L87 Difference]: Start difference. First operand 5757 states and 12813 transitions. Second operand 5 states. [2019-12-19 00:43:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:45,890 INFO L93 Difference]: Finished difference Result 12046 states and 26381 transitions. [2019-12-19 00:43:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:43:45,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 00:43:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:45,906 INFO L225 Difference]: With dead ends: 12046 [2019-12-19 00:43:45,906 INFO L226 Difference]: Without dead ends: 12032 [2019-12-19 00:43:45,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:43:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12032 states. [2019-12-19 00:43:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12032 to 7935. [2019-12-19 00:43:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-12-19 00:43:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 17552 transitions. [2019-12-19 00:43:46,053 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 17552 transitions. Word has length 95 [2019-12-19 00:43:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:46,054 INFO L462 AbstractCegarLoop]: Abstraction has 7935 states and 17552 transitions. [2019-12-19 00:43:46,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:43:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 17552 transitions. [2019-12-19 00:43:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:43:46,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:46,065 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] [2019-12-19 00:43:46,065 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:46,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:46,065 INFO L82 PathProgramCache]: Analyzing trace with hash 148102284, now seen corresponding path program 1 times [2019-12-19 00:43:46,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:46,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803232065] [2019-12-19 00:43:46,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:46,150 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-19 00:43:46,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803232065] [2019-12-19 00:43:46,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:46,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:43:46,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309079565] [2019-12-19 00:43:46,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:43:46,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:46,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:43:46,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:43:46,153 INFO L87 Difference]: Start difference. First operand 7935 states and 17552 transitions. Second operand 6 states. [2019-12-19 00:43:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:46,570 INFO L93 Difference]: Finished difference Result 10055 states and 22088 transitions. [2019-12-19 00:43:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 00:43:46,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 00:43:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:46,581 INFO L225 Difference]: With dead ends: 10055 [2019-12-19 00:43:46,581 INFO L226 Difference]: Without dead ends: 10055 [2019-12-19 00:43:46,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:43:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10055 states. [2019-12-19 00:43:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10055 to 7937. [2019-12-19 00:43:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-19 00:43:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17521 transitions. [2019-12-19 00:43:46,664 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17521 transitions. Word has length 95 [2019-12-19 00:43:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:46,665 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17521 transitions. [2019-12-19 00:43:46,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:43:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17521 transitions. [2019-12-19 00:43:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:43:46,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:46,674 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] [2019-12-19 00:43:46,675 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2039041963, now seen corresponding path program 1 times [2019-12-19 00:43:46,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:46,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066273956] [2019-12-19 00:43:46,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:46,828 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-19 00:43:46,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066273956] [2019-12-19 00:43:46,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:46,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 00:43:46,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188713514] [2019-12-19 00:43:46,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 00:43:46,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:46,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 00:43:46,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:43:46,830 INFO L87 Difference]: Start difference. First operand 7937 states and 17521 transitions. Second operand 9 states. [2019-12-19 00:43:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:47,603 INFO L93 Difference]: Finished difference Result 10174 states and 22470 transitions. [2019-12-19 00:43:47,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 00:43:47,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-19 00:43:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:47,616 INFO L225 Difference]: With dead ends: 10174 [2019-12-19 00:43:47,616 INFO L226 Difference]: Without dead ends: 10156 [2019-12-19 00:43:47,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-19 00:43:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2019-12-19 00:43:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 9171. [2019-12-19 00:43:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9171 states. [2019-12-19 00:43:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9171 states to 9171 states and 20276 transitions. [2019-12-19 00:43:47,712 INFO L78 Accepts]: Start accepts. Automaton has 9171 states and 20276 transitions. Word has length 95 [2019-12-19 00:43:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:47,712 INFO L462 AbstractCegarLoop]: Abstraction has 9171 states and 20276 transitions. [2019-12-19 00:43:47,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 00:43:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 9171 states and 20276 transitions. [2019-12-19 00:43:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:43:47,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:47,720 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] [2019-12-19 00:43:47,720 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash 458973974, now seen corresponding path program 1 times [2019-12-19 00:43:47,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:47,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663002611] [2019-12-19 00:43:47,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:47,826 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-19 00:43:47,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663002611] [2019-12-19 00:43:47,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:47,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 00:43:47,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153840975] [2019-12-19 00:43:47,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 00:43:47,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:47,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 00:43:47,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:43:47,828 INFO L87 Difference]: Start difference. First operand 9171 states and 20276 transitions. Second operand 8 states. [2019-12-19 00:43:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:48,780 INFO L93 Difference]: Finished difference Result 14959 states and 33331 transitions. [2019-12-19 00:43:48,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:43:48,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-19 00:43:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:48,799 INFO L225 Difference]: With dead ends: 14959 [2019-12-19 00:43:48,800 INFO L226 Difference]: Without dead ends: 14959 [2019-12-19 00:43:48,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-19 00:43:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14959 states. [2019-12-19 00:43:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14959 to 9554. [2019-12-19 00:43:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9554 states. [2019-12-19 00:43:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9554 states to 9554 states and 21229 transitions. [2019-12-19 00:43:48,932 INFO L78 Accepts]: Start accepts. Automaton has 9554 states and 21229 transitions. Word has length 95 [2019-12-19 00:43:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:48,932 INFO L462 AbstractCegarLoop]: Abstraction has 9554 states and 21229 transitions. [2019-12-19 00:43:48,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 00:43:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 9554 states and 21229 transitions. [2019-12-19 00:43:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:43:48,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:48,941 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] [2019-12-19 00:43:48,941 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:48,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1346477655, now seen corresponding path program 1 times [2019-12-19 00:43:48,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:48,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829022321] [2019-12-19 00:43:48,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:49,054 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-19 00:43:49,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829022321] [2019-12-19 00:43:49,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:49,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:43:49,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237126445] [2019-12-19 00:43:49,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:43:49,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:49,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:43:49,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:43:49,056 INFO L87 Difference]: Start difference. First operand 9554 states and 21229 transitions. Second operand 7 states. [2019-12-19 00:43:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:49,251 INFO L93 Difference]: Finished difference Result 9634 states and 21541 transitions. [2019-12-19 00:43:49,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:43:49,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-19 00:43:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:49,260 INFO L225 Difference]: With dead ends: 9634 [2019-12-19 00:43:49,261 INFO L226 Difference]: Without dead ends: 9634 [2019-12-19 00:43:49,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:43:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9634 states. [2019-12-19 00:43:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9634 to 7355. [2019-12-19 00:43:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7355 states. [2019-12-19 00:43:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 16376 transitions. [2019-12-19 00:43:49,341 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 16376 transitions. Word has length 95 [2019-12-19 00:43:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:49,341 INFO L462 AbstractCegarLoop]: Abstraction has 7355 states and 16376 transitions. [2019-12-19 00:43:49,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:43:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 16376 transitions. [2019-12-19 00:43:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:43:49,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:49,347 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] [2019-12-19 00:43:49,347 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:49,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash -385497897, now seen corresponding path program 1 times [2019-12-19 00:43:49,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:49,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765881222] [2019-12-19 00:43:49,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:49,438 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-19 00:43:49,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765881222] [2019-12-19 00:43:49,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:49,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:43:49,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064028222] [2019-12-19 00:43:49,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:43:49,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:49,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:43:49,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:43:49,440 INFO L87 Difference]: Start difference. First operand 7355 states and 16376 transitions. Second operand 6 states. [2019-12-19 00:43:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:49,586 INFO L93 Difference]: Finished difference Result 7085 states and 15602 transitions. [2019-12-19 00:43:49,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:43:49,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 00:43:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:49,597 INFO L225 Difference]: With dead ends: 7085 [2019-12-19 00:43:49,597 INFO L226 Difference]: Without dead ends: 7085 [2019-12-19 00:43:49,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:43:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2019-12-19 00:43:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 4422. [2019-12-19 00:43:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2019-12-19 00:43:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 9758 transitions. [2019-12-19 00:43:49,702 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 9758 transitions. Word has length 95 [2019-12-19 00:43:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:49,703 INFO L462 AbstractCegarLoop]: Abstraction has 4422 states and 9758 transitions. [2019-12-19 00:43:49,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:43:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 9758 transitions. [2019-12-19 00:43:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:49,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:49,709 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, 1] [2019-12-19 00:43:49,709 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash 881537949, now seen corresponding path program 1 times [2019-12-19 00:43:49,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:49,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588529204] [2019-12-19 00:43:49,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:49,909 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-19 00:43:49,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588529204] [2019-12-19 00:43:49,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:49,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-19 00:43:49,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526011398] [2019-12-19 00:43:49,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-19 00:43:49,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:49,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-19 00:43:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-19 00:43:49,911 INFO L87 Difference]: Start difference. First operand 4422 states and 9758 transitions. Second operand 13 states. [2019-12-19 00:43:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:51,201 INFO L93 Difference]: Finished difference Result 6204 states and 13416 transitions. [2019-12-19 00:43:51,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-19 00:43:51,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-12-19 00:43:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:51,209 INFO L225 Difference]: With dead ends: 6204 [2019-12-19 00:43:51,210 INFO L226 Difference]: Without dead ends: 6204 [2019-12-19 00:43:51,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-12-19 00:43:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6204 states. [2019-12-19 00:43:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6204 to 5122. [2019-12-19 00:43:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5122 states. [2019-12-19 00:43:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 11232 transitions. [2019-12-19 00:43:51,260 INFO L78 Accepts]: Start accepts. Automaton has 5122 states and 11232 transitions. Word has length 97 [2019-12-19 00:43:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:51,260 INFO L462 AbstractCegarLoop]: Abstraction has 5122 states and 11232 transitions. [2019-12-19 00:43:51,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-19 00:43:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5122 states and 11232 transitions. [2019-12-19 00:43:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:51,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:51,264 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, 1] [2019-12-19 00:43:51,265 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:51,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1769041630, now seen corresponding path program 1 times [2019-12-19 00:43:51,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:51,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44822344] [2019-12-19 00:43:51,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:51,419 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-19 00:43:51,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44822344] [2019-12-19 00:43:51,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:51,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 00:43:51,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77652963] [2019-12-19 00:43:51,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 00:43:51,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:51,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 00:43:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:43:51,421 INFO L87 Difference]: Start difference. First operand 5122 states and 11232 transitions. Second operand 10 states. [2019-12-19 00:43:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:51,910 INFO L93 Difference]: Finished difference Result 16951 states and 37952 transitions. [2019-12-19 00:43:51,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 00:43:51,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-19 00:43:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:51,925 INFO L225 Difference]: With dead ends: 16951 [2019-12-19 00:43:51,925 INFO L226 Difference]: Without dead ends: 11181 [2019-12-19 00:43:51,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 00:43:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11181 states. [2019-12-19 00:43:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11181 to 5182. [2019-12-19 00:43:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5182 states. [2019-12-19 00:43:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 11303 transitions. [2019-12-19 00:43:52,004 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 11303 transitions. Word has length 97 [2019-12-19 00:43:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:52,005 INFO L462 AbstractCegarLoop]: Abstraction has 5182 states and 11303 transitions. [2019-12-19 00:43:52,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 00:43:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 11303 transitions. [2019-12-19 00:43:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:52,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:52,010 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, 1] [2019-12-19 00:43:52,010 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1980984750, now seen corresponding path program 2 times [2019-12-19 00:43:52,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:52,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783691240] [2019-12-19 00:43:52,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:43:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:43:52,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 00:43:52,101 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 00:43:52,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:43:52 BasicIcfg [2019-12-19 00:43:52,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 00:43:52,634 INFO L168 Benchmark]: Toolchain (without parser) took 53974.12 ms. Allocated memory was 145.2 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 101.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-19 00:43:52,635 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-19 00:43:52,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.36 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.2 MB in the beginning and 156.3 MB in the end (delta: -55.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-19 00:43:52,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 00:43:52,641 INFO L168 Benchmark]: Boogie Preprocessor took 51.37 ms. Allocated memory is still 201.9 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 00:43:52,642 INFO L168 Benchmark]: RCFGBuilder took 693.06 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 106.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-19 00:43:52,643 INFO L168 Benchmark]: TraceAbstraction took 52357.71 ms. Allocated memory was 201.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 00:43:52,648 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.36 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.2 MB in the beginning and 156.3 MB in the end (delta: -55.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.37 ms. Allocated memory is still 201.9 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 693.06 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 106.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52357.71 ms. Allocated memory was 201.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 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] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L715] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L716] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L717] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L718] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L719] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L720] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L798] 0 pthread_t t313; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L799] FCALL, FORK 0 pthread_create(&t313, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L731] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L732] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L733] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L740] 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, __unbuffered_p1_EBX=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] [L800] 0 pthread_t t314; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L801] FCALL, FORK 0 pthread_create(&t314, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L764] 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=1, __unbuffered_p1_EBX=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] [L740] 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) [L741] 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=1, __unbuffered_p1_EBX=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] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 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 [!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=1, __unbuffered_p1_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 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 [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 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=1, __unbuffered_p1_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L744] 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 [!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=1, __unbuffered_p1_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 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) [L765] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 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)) [L766] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L767] 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=1, __unbuffered_p1_EBX=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] [L767] 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)) [L768] 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=1, __unbuffered_p1_EBX=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] [L768] 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)) [L769] 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=1, __unbuffered_p1_EBX=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] [L769] 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)) [L770] 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=1, __unbuffered_p1_EBX=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] [L770] 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)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L772] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L772] 2 y = y$flush_delayed ? y$mem_tmp : y [L773] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L776] 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=1, __unbuffered_p1_EBX=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] [L776] 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=1, __unbuffered_p1_EBX=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] [L776] 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=1, __unbuffered_p1_EBX=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] [L776] 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) [L777] 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=1, __unbuffered_p1_EBX=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] [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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=1, __unbuffered_p1_EBX=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] [L778] 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 [L779] 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=1, __unbuffered_p1_EBX=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] [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 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=1, __unbuffered_p1_EBX=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] [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L803] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L807] 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=1, __unbuffered_p1_EBX=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] [L807] 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=1, __unbuffered_p1_EBX=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] [L807] 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=1, __unbuffered_p1_EBX=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] [L807] 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) [L808] 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=1, __unbuffered_p1_EBX=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] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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=1, __unbuffered_p1_EBX=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] [L809] 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 [L810] 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=1, __unbuffered_p1_EBX=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] [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] 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=1, __unbuffered_p1_EBX=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] [L811] 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 [L814] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, __unbuffered_p1_EBX=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=1, __unbuffered_p1_EBX=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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 51.5s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8956 SDtfs, 9901 SDslu, 22108 SDs, 0 SdLazy, 10033 SolverSat, 595 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 96 SyntacticMatches, 13 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71013occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 89973 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2309 NumberOfCodeBlocks, 2309 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2181 ConstructedInterpolants, 0 QuantifiedInterpolants, 461575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...