/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/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 05:18:42,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 05:18:42,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 05:18:42,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 05:18:42,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 05:18:42,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 05:18:42,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 05:18:42,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 05:18:42,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 05:18:42,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 05:18:42,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 05:18:42,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 05:18:42,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 05:18:42,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 05:18:42,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 05:18:42,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 05:18:42,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 05:18:42,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 05:18:42,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 05:18:42,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 05:18:42,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 05:18:42,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 05:18:42,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 05:18:42,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 05:18:42,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 05:18:42,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 05:18:42,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 05:18:42,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 05:18:42,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 05:18:42,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 05:18:42,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 05:18:42,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 05:18:42,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 05:18:42,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 05:18:42,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 05:18:42,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 05:18:42,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 05:18:42,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 05:18:42,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 05:18:42,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 05:18:42,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 05:18:42,408 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 05:18:42,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 05:18:42,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 05:18:42,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 05:18:42,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 05:18:42,435 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 05:18:42,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 05:18:42,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 05:18:42,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 05:18:42,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 05:18:42,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 05:18:42,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 05:18:42,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 05:18:42,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 05:18:42,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 05:18:42,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 05:18:42,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 05:18:42,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 05:18:42,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 05:18:42,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 05:18:42,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 05:18:42,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 05:18:42,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 05:18:42,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 05:18:42,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 05:18:42,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 05:18:42,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 05:18:42,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 05:18:42,439 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 05:18:42,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 05:18:42,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 05:18:42,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 05:18:42,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 05:18:42,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 05:18:42,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 05:18:42,766 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 05:18:42,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-19 05:18:42,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265a50de0/74451423ebbf4629b73f17afa93177fc/FLAGcafd28516 [2019-12-19 05:18:43,453 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 05:18:43,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-19 05:18:43,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265a50de0/74451423ebbf4629b73f17afa93177fc/FLAGcafd28516 [2019-12-19 05:18:43,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265a50de0/74451423ebbf4629b73f17afa93177fc [2019-12-19 05:18:43,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 05:18:43,719 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 05:18:43,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 05:18:43,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 05:18:43,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 05:18:43,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:18:43" (1/1) ... [2019-12-19 05:18:43,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b75db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:43, skipping insertion in model container [2019-12-19 05:18:43,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:18:43" (1/1) ... [2019-12-19 05:18:43,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 05:18:43,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 05:18:44,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:18:44,313 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 05:18:44,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:18:44,474 INFO L208 MainTranslator]: Completed translation [2019-12-19 05:18:44,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44 WrapperNode [2019-12-19 05:18:44,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 05:18:44,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 05:18:44,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 05:18:44,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 05:18:44,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (1/1) ... [2019-12-19 05:18:44,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (1/1) ... [2019-12-19 05:18:44,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 05:18:44,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 05:18:44,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 05:18:44,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 05:18:44,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (1/1) ... [2019-12-19 05:18:44,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (1/1) ... [2019-12-19 05:18:44,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (1/1) ... [2019-12-19 05:18:44,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (1/1) ... [2019-12-19 05:18:44,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (1/1) ... [2019-12-19 05:18:44,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (1/1) ... [2019-12-19 05:18:44,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (1/1) ... [2019-12-19 05:18:44,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 05:18:44,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 05:18:44,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 05:18:44,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 05:18:44,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (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 05:18:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 05:18:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 05:18:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 05:18:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 05:18:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 05:18:44,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 05:18:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 05:18:44,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 05:18:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 05:18:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 05:18:44,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 05:18:44,649 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 05:18:45,340 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 05:18:45,341 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 05:18:45,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:18:45 BoogieIcfgContainer [2019-12-19 05:18:45,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 05:18:45,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 05:18:45,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 05:18:45,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 05:18:45,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:18:43" (1/3) ... [2019-12-19 05:18:45,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad39dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:18:45, skipping insertion in model container [2019-12-19 05:18:45,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:44" (2/3) ... [2019-12-19 05:18:45,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad39dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:18:45, skipping insertion in model container [2019-12-19 05:18:45,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:18:45" (3/3) ... [2019-12-19 05:18:45,352 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2019-12-19 05:18:45,363 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 05:18:45,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 05:18:45,375 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 05:18:45,376 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 05:18:45,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,432 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,432 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,433 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,466 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,466 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,471 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,472 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:45,490 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 05:18:45,512 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 05:18:45,512 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 05:18:45,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 05:18:45,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 05:18:45,513 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 05:18:45,513 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 05:18:45,513 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 05:18:45,513 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 05:18:45,528 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145 places, 179 transitions [2019-12-19 05:18:46,991 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22509 states. [2019-12-19 05:18:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 22509 states. [2019-12-19 05:18:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-19 05:18:47,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:18:47,004 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] [2019-12-19 05:18:47,005 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:18:47,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:18:47,012 INFO L82 PathProgramCache]: Analyzing trace with hash -641553760, now seen corresponding path program 1 times [2019-12-19 05:18:47,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:18:47,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084422081] [2019-12-19 05:18:47,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:18:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:18:47,370 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 05:18:47,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084422081] [2019-12-19 05:18:47,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:18:47,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:18:47,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574438601] [2019-12-19 05:18:47,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:18:47,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:18:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:18:47,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:18:47,398 INFO L87 Difference]: Start difference. First operand 22509 states. Second operand 4 states. [2019-12-19 05:18:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:18:48,079 INFO L93 Difference]: Finished difference Result 23453 states and 91770 transitions. [2019-12-19 05:18:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:18:48,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-19 05:18:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:18:48,273 INFO L225 Difference]: With dead ends: 23453 [2019-12-19 05:18:48,273 INFO L226 Difference]: Without dead ends: 21277 [2019-12-19 05:18:48,275 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 05:18:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21277 states. [2019-12-19 05:18:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21277 to 21277. [2019-12-19 05:18:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21277 states. [2019-12-19 05:18:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21277 states to 21277 states and 83794 transitions. [2019-12-19 05:18:50,138 INFO L78 Accepts]: Start accepts. Automaton has 21277 states and 83794 transitions. Word has length 32 [2019-12-19 05:18:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:18:50,139 INFO L462 AbstractCegarLoop]: Abstraction has 21277 states and 83794 transitions. [2019-12-19 05:18:50,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:18:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 21277 states and 83794 transitions. [2019-12-19 05:18:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-19 05:18:50,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:18:50,152 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] [2019-12-19 05:18:50,152 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:18:50,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:18:50,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2036668926, now seen corresponding path program 1 times [2019-12-19 05:18:50,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:18:50,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135447901] [2019-12-19 05:18:50,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:18:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:18:50,272 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 05:18:50,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135447901] [2019-12-19 05:18:50,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:18:50,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:18:50,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092460216] [2019-12-19 05:18:50,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:18:50,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:18:50,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:18:50,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:18:50,277 INFO L87 Difference]: Start difference. First operand 21277 states and 83794 transitions. Second operand 5 states. [2019-12-19 05:18:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:18:51,270 INFO L93 Difference]: Finished difference Result 34711 states and 129090 transitions. [2019-12-19 05:18:51,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:18:51,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-19 05:18:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:18:51,435 INFO L225 Difference]: With dead ends: 34711 [2019-12-19 05:18:51,436 INFO L226 Difference]: Without dead ends: 34567 [2019-12-19 05:18:51,437 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 05:18:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34567 states. [2019-12-19 05:18:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34567 to 33067. [2019-12-19 05:18:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33067 states. [2019-12-19 05:18:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33067 states to 33067 states and 123978 transitions. [2019-12-19 05:18:53,815 INFO L78 Accepts]: Start accepts. Automaton has 33067 states and 123978 transitions. Word has length 43 [2019-12-19 05:18:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:18:53,818 INFO L462 AbstractCegarLoop]: Abstraction has 33067 states and 123978 transitions. [2019-12-19 05:18:53,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:18:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 33067 states and 123978 transitions. [2019-12-19 05:18:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 05:18:53,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:18:53,827 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] [2019-12-19 05:18:53,827 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:18:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:18:53,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1802978339, now seen corresponding path program 1 times [2019-12-19 05:18:53,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:18:53,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351870379] [2019-12-19 05:18:53,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:18:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:18:53,975 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 05:18:53,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351870379] [2019-12-19 05:18:53,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:18:53,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:18:53,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001373872] [2019-12-19 05:18:53,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:18:53,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:18:53,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:18:53,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:18:53,978 INFO L87 Difference]: Start difference. First operand 33067 states and 123978 transitions. Second operand 5 states. [2019-12-19 05:18:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:18:54,992 INFO L93 Difference]: Finished difference Result 40219 states and 148647 transitions. [2019-12-19 05:18:54,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:18:54,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 05:18:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:18:55,121 INFO L225 Difference]: With dead ends: 40219 [2019-12-19 05:18:55,122 INFO L226 Difference]: Without dead ends: 40059 [2019-12-19 05:18:55,122 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 05:18:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40059 states. [2019-12-19 05:18:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40059 to 34640. [2019-12-19 05:18:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34640 states. [2019-12-19 05:18:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34640 states to 34640 states and 129274 transitions. [2019-12-19 05:18:57,576 INFO L78 Accepts]: Start accepts. Automaton has 34640 states and 129274 transitions. Word has length 44 [2019-12-19 05:18:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:18:57,577 INFO L462 AbstractCegarLoop]: Abstraction has 34640 states and 129274 transitions. [2019-12-19 05:18:57,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:18:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 34640 states and 129274 transitions. [2019-12-19 05:18:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 05:18:57,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:18:57,591 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] [2019-12-19 05:18:57,591 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:18:57,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:18:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1187379522, now seen corresponding path program 1 times [2019-12-19 05:18:57,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:18:57,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077518912] [2019-12-19 05:18:57,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:18:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:18:57,672 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 05:18:57,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077518912] [2019-12-19 05:18:57,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:18:57,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:18:57,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139531430] [2019-12-19 05:18:57,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:18:57,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:18:57,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:18:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:18:57,675 INFO L87 Difference]: Start difference. First operand 34640 states and 129274 transitions. Second operand 6 states. [2019-12-19 05:18:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:18:58,913 INFO L93 Difference]: Finished difference Result 45668 states and 166168 transitions. [2019-12-19 05:18:58,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:18:58,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-19 05:18:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:18:59,054 INFO L225 Difference]: With dead ends: 45668 [2019-12-19 05:18:59,055 INFO L226 Difference]: Without dead ends: 45524 [2019-12-19 05:18:59,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 05:18:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45524 states. [2019-12-19 05:19:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45524 to 33603. [2019-12-19 05:19:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33603 states. [2019-12-19 05:19:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33603 states to 33603 states and 125429 transitions. [2019-12-19 05:19:01,421 INFO L78 Accepts]: Start accepts. Automaton has 33603 states and 125429 transitions. Word has length 51 [2019-12-19 05:19:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:01,422 INFO L462 AbstractCegarLoop]: Abstraction has 33603 states and 125429 transitions. [2019-12-19 05:19:01,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 33603 states and 125429 transitions. [2019-12-19 05:19:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 05:19:01,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:01,458 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] [2019-12-19 05:19:01,458 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2042153850, now seen corresponding path program 1 times [2019-12-19 05:19:01,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:01,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320004465] [2019-12-19 05:19:01,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:01,581 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 05:19:01,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320004465] [2019-12-19 05:19:01,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:01,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:01,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709944985] [2019-12-19 05:19:01,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:01,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:01,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:01,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:01,584 INFO L87 Difference]: Start difference. First operand 33603 states and 125429 transitions. Second operand 6 states. [2019-12-19 05:19:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:02,562 INFO L93 Difference]: Finished difference Result 46075 states and 167862 transitions. [2019-12-19 05:19:02,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 05:19:02,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-19 05:19:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:02,698 INFO L225 Difference]: With dead ends: 46075 [2019-12-19 05:19:02,698 INFO L226 Difference]: Without dead ends: 45835 [2019-12-19 05:19:02,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:19:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45835 states. [2019-12-19 05:19:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45835 to 39964. [2019-12-19 05:19:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39964 states. [2019-12-19 05:19:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39964 states to 39964 states and 147353 transitions. [2019-12-19 05:19:05,193 INFO L78 Accepts]: Start accepts. Automaton has 39964 states and 147353 transitions. Word has length 58 [2019-12-19 05:19:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:05,193 INFO L462 AbstractCegarLoop]: Abstraction has 39964 states and 147353 transitions. [2019-12-19 05:19:05,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 39964 states and 147353 transitions. [2019-12-19 05:19:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:19:05,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:05,225 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] [2019-12-19 05:19:05,226 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:05,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1541499923, now seen corresponding path program 1 times [2019-12-19 05:19:05,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:05,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945432718] [2019-12-19 05:19:05,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:05,273 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 05:19:05,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945432718] [2019-12-19 05:19:05,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:05,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:05,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861675979] [2019-12-19 05:19:05,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:05,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:05,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:05,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:05,275 INFO L87 Difference]: Start difference. First operand 39964 states and 147353 transitions. Second operand 3 states. [2019-12-19 05:19:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:05,516 INFO L93 Difference]: Finished difference Result 50262 states and 182188 transitions. [2019-12-19 05:19:05,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:05,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-19 05:19:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:05,618 INFO L225 Difference]: With dead ends: 50262 [2019-12-19 05:19:05,618 INFO L226 Difference]: Without dead ends: 50262 [2019-12-19 05:19:05,619 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 05:19:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50262 states. [2019-12-19 05:19:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50262 to 43894. [2019-12-19 05:19:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43894 states. [2019-12-19 05:19:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43894 states to 43894 states and 160791 transitions. [2019-12-19 05:19:06,737 INFO L78 Accepts]: Start accepts. Automaton has 43894 states and 160791 transitions. Word has length 60 [2019-12-19 05:19:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:06,737 INFO L462 AbstractCegarLoop]: Abstraction has 43894 states and 160791 transitions. [2019-12-19 05:19:06,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 43894 states and 160791 transitions. [2019-12-19 05:19:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 05:19:06,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:06,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] [2019-12-19 05:19:06,772 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:06,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:06,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1207224336, now seen corresponding path program 1 times [2019-12-19 05:19:06,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:06,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757171778] [2019-12-19 05:19:06,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:06,868 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 05:19:06,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757171778] [2019-12-19 05:19:06,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:06,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:06,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835503809] [2019-12-19 05:19:06,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:06,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:06,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:06,870 INFO L87 Difference]: Start difference. First operand 43894 states and 160791 transitions. Second operand 7 states. [2019-12-19 05:19:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:08,217 INFO L93 Difference]: Finished difference Result 55890 states and 200525 transitions. [2019-12-19 05:19:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:19:08,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-19 05:19:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:08,336 INFO L225 Difference]: With dead ends: 55890 [2019-12-19 05:19:08,336 INFO L226 Difference]: Without dead ends: 55650 [2019-12-19 05:19:08,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 05:19:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55650 states. [2019-12-19 05:19:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55650 to 45120. [2019-12-19 05:19:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45120 states. [2019-12-19 05:19:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45120 states to 45120 states and 164958 transitions. [2019-12-19 05:19:11,038 INFO L78 Accepts]: Start accepts. Automaton has 45120 states and 164958 transitions. Word has length 64 [2019-12-19 05:19:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:11,039 INFO L462 AbstractCegarLoop]: Abstraction has 45120 states and 164958 transitions. [2019-12-19 05:19:11,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 45120 states and 164958 transitions. [2019-12-19 05:19:11,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 05:19:11,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:11,076 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] [2019-12-19 05:19:11,076 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2064437065, now seen corresponding path program 1 times [2019-12-19 05:19:11,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:11,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938671219] [2019-12-19 05:19:11,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:11,153 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 05:19:11,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938671219] [2019-12-19 05:19:11,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:11,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:11,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222959489] [2019-12-19 05:19:11,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:11,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:11,155 INFO L87 Difference]: Start difference. First operand 45120 states and 164958 transitions. Second operand 6 states. [2019-12-19 05:19:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:11,988 INFO L93 Difference]: Finished difference Result 62662 states and 223894 transitions. [2019-12-19 05:19:11,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 05:19:11,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 05:19:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:12,549 INFO L225 Difference]: With dead ends: 62662 [2019-12-19 05:19:12,549 INFO L226 Difference]: Without dead ends: 62518 [2019-12-19 05:19:12,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:19:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62518 states. [2019-12-19 05:19:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62518 to 48801. [2019-12-19 05:19:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48801 states. [2019-12-19 05:19:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48801 states to 48801 states and 177924 transitions. [2019-12-19 05:19:16,129 INFO L78 Accepts]: Start accepts. Automaton has 48801 states and 177924 transitions. Word has length 65 [2019-12-19 05:19:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:16,130 INFO L462 AbstractCegarLoop]: Abstraction has 48801 states and 177924 transitions. [2019-12-19 05:19:16,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 48801 states and 177924 transitions. [2019-12-19 05:19:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 05:19:16,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:16,166 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] [2019-12-19 05:19:16,166 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:16,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:16,167 INFO L82 PathProgramCache]: Analyzing trace with hash -978936533, now seen corresponding path program 2 times [2019-12-19 05:19:16,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:16,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259584693] [2019-12-19 05:19:16,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:16,255 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 05:19:16,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259584693] [2019-12-19 05:19:16,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:16,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:16,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163111086] [2019-12-19 05:19:16,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:16,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:16,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:16,257 INFO L87 Difference]: Start difference. First operand 48801 states and 177924 transitions. Second operand 7 states. [2019-12-19 05:19:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:17,456 INFO L93 Difference]: Finished difference Result 58785 states and 210668 transitions. [2019-12-19 05:19:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:19:17,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 05:19:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:17,580 INFO L225 Difference]: With dead ends: 58785 [2019-12-19 05:19:17,580 INFO L226 Difference]: Without dead ends: 58585 [2019-12-19 05:19:17,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 05:19:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58585 states. [2019-12-19 05:19:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58585 to 45998. [2019-12-19 05:19:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45998 states. [2019-12-19 05:19:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45998 states to 45998 states and 167829 transitions. [2019-12-19 05:19:18,714 INFO L78 Accepts]: Start accepts. Automaton has 45998 states and 167829 transitions. Word has length 65 [2019-12-19 05:19:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:18,714 INFO L462 AbstractCegarLoop]: Abstraction has 45998 states and 167829 transitions. [2019-12-19 05:19:18,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45998 states and 167829 transitions. [2019-12-19 05:19:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:19:18,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:18,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:18,753 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:18,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash 379551327, now seen corresponding path program 1 times [2019-12-19 05:19:18,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:18,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595443583] [2019-12-19 05:19:18,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:18,803 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 05:19:18,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595443583] [2019-12-19 05:19:18,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:18,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:18,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259187205] [2019-12-19 05:19:18,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:18,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:18,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:18,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:18,806 INFO L87 Difference]: Start difference. First operand 45998 states and 167829 transitions. Second operand 3 states. [2019-12-19 05:19:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:19,201 INFO L93 Difference]: Finished difference Result 61492 states and 224163 transitions. [2019-12-19 05:19:19,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:19,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 05:19:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:19,336 INFO L225 Difference]: With dead ends: 61492 [2019-12-19 05:19:19,336 INFO L226 Difference]: Without dead ends: 61492 [2019-12-19 05:19:19,336 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 05:19:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61492 states. [2019-12-19 05:19:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61492 to 53439. [2019-12-19 05:19:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53439 states. [2019-12-19 05:19:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53439 states to 53439 states and 195642 transitions. [2019-12-19 05:19:20,837 INFO L78 Accepts]: Start accepts. Automaton has 53439 states and 195642 transitions. Word has length 67 [2019-12-19 05:19:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:20,837 INFO L462 AbstractCegarLoop]: Abstraction has 53439 states and 195642 transitions. [2019-12-19 05:19:20,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 53439 states and 195642 transitions. [2019-12-19 05:19:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:19:20,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:20,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:20,895 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1904207583, now seen corresponding path program 1 times [2019-12-19 05:19:20,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:20,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965934662] [2019-12-19 05:19:20,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:20,999 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 05:19:20,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965934662] [2019-12-19 05:19:20,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:21,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:21,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544836072] [2019-12-19 05:19:21,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:21,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:21,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:21,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:21,002 INFO L87 Difference]: Start difference. First operand 53439 states and 195642 transitions. Second operand 6 states. [2019-12-19 05:19:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:21,714 INFO L93 Difference]: Finished difference Result 65988 states and 238856 transitions. [2019-12-19 05:19:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:21,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 05:19:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:22,361 INFO L225 Difference]: With dead ends: 65988 [2019-12-19 05:19:22,361 INFO L226 Difference]: Without dead ends: 65344 [2019-12-19 05:19:22,362 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 05:19:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65344 states. [2019-12-19 05:19:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65344 to 56048. [2019-12-19 05:19:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56048 states. [2019-12-19 05:19:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56048 states to 56048 states and 204359 transitions. [2019-12-19 05:19:23,427 INFO L78 Accepts]: Start accepts. Automaton has 56048 states and 204359 transitions. Word has length 67 [2019-12-19 05:19:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:23,427 INFO L462 AbstractCegarLoop]: Abstraction has 56048 states and 204359 transitions. [2019-12-19 05:19:23,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 56048 states and 204359 transitions. [2019-12-19 05:19:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:19:23,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:23,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:23,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1429145696, now seen corresponding path program 1 times [2019-12-19 05:19:23,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:23,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839164393] [2019-12-19 05:19:23,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:19:24,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839164393] [2019-12-19 05:19:24,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:24,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:24,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924827417] [2019-12-19 05:19:24,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:24,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:24,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:24,148 INFO L87 Difference]: Start difference. First operand 56048 states and 204359 transitions. Second operand 7 states. [2019-12-19 05:19:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:25,280 INFO L93 Difference]: Finished difference Result 83036 states and 292787 transitions. [2019-12-19 05:19:25,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:19:25,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 05:19:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:25,460 INFO L225 Difference]: With dead ends: 83036 [2019-12-19 05:19:25,460 INFO L226 Difference]: Without dead ends: 83036 [2019-12-19 05:19:25,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 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 05:19:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83036 states. [2019-12-19 05:19:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83036 to 76085. [2019-12-19 05:19:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76085 states. [2019-12-19 05:19:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76085 states to 76085 states and 270654 transitions. [2019-12-19 05:19:27,320 INFO L78 Accepts]: Start accepts. Automaton has 76085 states and 270654 transitions. Word has length 67 [2019-12-19 05:19:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:27,320 INFO L462 AbstractCegarLoop]: Abstraction has 76085 states and 270654 transitions. [2019-12-19 05:19:27,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 76085 states and 270654 transitions. [2019-12-19 05:19:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:19:27,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:27,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:27,384 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash -184381215, now seen corresponding path program 1 times [2019-12-19 05:19:27,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:27,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235584571] [2019-12-19 05:19:27,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:27,461 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 05:19:27,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235584571] [2019-12-19 05:19:27,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:27,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:27,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552634160] [2019-12-19 05:19:27,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:27,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:27,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:27,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:27,464 INFO L87 Difference]: Start difference. First operand 76085 states and 270654 transitions. Second operand 4 states. [2019-12-19 05:19:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:27,568 INFO L93 Difference]: Finished difference Result 17230 states and 54532 transitions. [2019-12-19 05:19:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:19:27,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 05:19:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:27,604 INFO L225 Difference]: With dead ends: 17230 [2019-12-19 05:19:27,604 INFO L226 Difference]: Without dead ends: 16752 [2019-12-19 05:19:27,604 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 05:19:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16752 states. [2019-12-19 05:19:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16752 to 16740. [2019-12-19 05:19:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16740 states. [2019-12-19 05:19:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16740 states to 16740 states and 53027 transitions. [2019-12-19 05:19:27,892 INFO L78 Accepts]: Start accepts. Automaton has 16740 states and 53027 transitions. Word has length 67 [2019-12-19 05:19:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:27,893 INFO L462 AbstractCegarLoop]: Abstraction has 16740 states and 53027 transitions. [2019-12-19 05:19:27,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 16740 states and 53027 transitions. [2019-12-19 05:19:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:19:27,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:27,910 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] [2019-12-19 05:19:27,911 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:27,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1457085175, now seen corresponding path program 1 times [2019-12-19 05:19:27,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:27,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307311743] [2019-12-19 05:19:27,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:27,969 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 05:19:27,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307311743] [2019-12-19 05:19:27,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:27,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:27,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165646950] [2019-12-19 05:19:27,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:27,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:27,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:27,971 INFO L87 Difference]: Start difference. First operand 16740 states and 53027 transitions. Second operand 4 states. [2019-12-19 05:19:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:28,337 INFO L93 Difference]: Finished difference Result 22104 states and 69108 transitions. [2019-12-19 05:19:28,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:19:28,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-19 05:19:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:28,371 INFO L225 Difference]: With dead ends: 22104 [2019-12-19 05:19:28,371 INFO L226 Difference]: Without dead ends: 22104 [2019-12-19 05:19:28,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 05:19:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-19 05:19:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 17616. [2019-12-19 05:19:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17616 states. [2019-12-19 05:19:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17616 states to 17616 states and 55586 transitions. [2019-12-19 05:19:28,625 INFO L78 Accepts]: Start accepts. Automaton has 17616 states and 55586 transitions. Word has length 77 [2019-12-19 05:19:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:28,625 INFO L462 AbstractCegarLoop]: Abstraction has 17616 states and 55586 transitions. [2019-12-19 05:19:28,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 17616 states and 55586 transitions. [2019-12-19 05:19:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:19:28,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:28,645 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] [2019-12-19 05:19:28,645 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1202348630, now seen corresponding path program 1 times [2019-12-19 05:19:28,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:28,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504734718] [2019-12-19 05:19:28,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:28,730 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 05:19:28,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504734718] [2019-12-19 05:19:28,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:28,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:19:28,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766619895] [2019-12-19 05:19:28,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:19:28,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:28,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:19:28,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:19:28,733 INFO L87 Difference]: Start difference. First operand 17616 states and 55586 transitions. Second operand 8 states. [2019-12-19 05:19:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:29,924 INFO L93 Difference]: Finished difference Result 19710 states and 61662 transitions. [2019-12-19 05:19:29,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 05:19:29,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-19 05:19:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:29,955 INFO L225 Difference]: With dead ends: 19710 [2019-12-19 05:19:29,955 INFO L226 Difference]: Without dead ends: 19662 [2019-12-19 05:19:29,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-19 05:19:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-19 05:19:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 15534. [2019-12-19 05:19:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15534 states. [2019-12-19 05:19:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15534 states to 15534 states and 49320 transitions. [2019-12-19 05:19:30,190 INFO L78 Accepts]: Start accepts. Automaton has 15534 states and 49320 transitions. Word has length 77 [2019-12-19 05:19:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:30,191 INFO L462 AbstractCegarLoop]: Abstraction has 15534 states and 49320 transitions. [2019-12-19 05:19:30,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:19:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 15534 states and 49320 transitions. [2019-12-19 05:19:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 05:19:30,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:30,204 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] [2019-12-19 05:19:30,204 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:30,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:30,205 INFO L82 PathProgramCache]: Analyzing trace with hash -155414719, now seen corresponding path program 1 times [2019-12-19 05:19:30,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:30,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803682908] [2019-12-19 05:19:30,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:30,249 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 05:19:30,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803682908] [2019-12-19 05:19:30,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:30,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:30,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869266348] [2019-12-19 05:19:30,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:30,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:30,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:30,254 INFO L87 Difference]: Start difference. First operand 15534 states and 49320 transitions. Second operand 3 states. [2019-12-19 05:19:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:30,588 INFO L93 Difference]: Finished difference Result 16798 states and 53033 transitions. [2019-12-19 05:19:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:30,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-19 05:19:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:30,624 INFO L225 Difference]: With dead ends: 16798 [2019-12-19 05:19:30,624 INFO L226 Difference]: Without dead ends: 16798 [2019-12-19 05:19:30,625 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 05:19:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16798 states. [2019-12-19 05:19:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16798 to 16150. [2019-12-19 05:19:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16150 states. [2019-12-19 05:19:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16150 states to 16150 states and 51134 transitions. [2019-12-19 05:19:30,893 INFO L78 Accepts]: Start accepts. Automaton has 16150 states and 51134 transitions. Word has length 78 [2019-12-19 05:19:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:30,893 INFO L462 AbstractCegarLoop]: Abstraction has 16150 states and 51134 transitions. [2019-12-19 05:19:30,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 16150 states and 51134 transitions. [2019-12-19 05:19:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:19:30,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:30,908 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] [2019-12-19 05:19:30,908 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:30,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2033602545, now seen corresponding path program 1 times [2019-12-19 05:19:30,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:30,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623485073] [2019-12-19 05:19:30,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:30,964 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 05:19:30,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623485073] [2019-12-19 05:19:30,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:30,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:30,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183273950] [2019-12-19 05:19:30,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:30,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:30,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:30,966 INFO L87 Difference]: Start difference. First operand 16150 states and 51134 transitions. Second operand 4 states. [2019-12-19 05:19:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:31,406 INFO L93 Difference]: Finished difference Result 19318 states and 60264 transitions. [2019-12-19 05:19:31,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:19:31,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-19 05:19:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:31,435 INFO L225 Difference]: With dead ends: 19318 [2019-12-19 05:19:31,435 INFO L226 Difference]: Without dead ends: 19318 [2019-12-19 05:19:31,436 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 05:19:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19318 states. [2019-12-19 05:19:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19318 to 18295. [2019-12-19 05:19:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18295 states. [2019-12-19 05:19:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18295 states to 18295 states and 57380 transitions. [2019-12-19 05:19:31,688 INFO L78 Accepts]: Start accepts. Automaton has 18295 states and 57380 transitions. Word has length 79 [2019-12-19 05:19:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:31,688 INFO L462 AbstractCegarLoop]: Abstraction has 18295 states and 57380 transitions. [2019-12-19 05:19:31,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 18295 states and 57380 transitions. [2019-12-19 05:19:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:19:31,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:31,704 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] [2019-12-19 05:19:31,705 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:31,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:31,705 INFO L82 PathProgramCache]: Analyzing trace with hash 332862066, now seen corresponding path program 1 times [2019-12-19 05:19:31,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:31,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571244748] [2019-12-19 05:19:31,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:31,763 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 05:19:31,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571244748] [2019-12-19 05:19:31,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:31,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:31,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036810719] [2019-12-19 05:19:31,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:31,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:31,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:31,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:31,768 INFO L87 Difference]: Start difference. First operand 18295 states and 57380 transitions. Second operand 3 states. [2019-12-19 05:19:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:32,032 INFO L93 Difference]: Finished difference Result 19638 states and 61303 transitions. [2019-12-19 05:19:32,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:32,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-19 05:19:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:32,062 INFO L225 Difference]: With dead ends: 19638 [2019-12-19 05:19:32,062 INFO L226 Difference]: Without dead ends: 19638 [2019-12-19 05:19:32,063 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 05:19:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19638 states. [2019-12-19 05:19:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19638 to 18975. [2019-12-19 05:19:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18975 states. [2019-12-19 05:19:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18975 states to 18975 states and 59360 transitions. [2019-12-19 05:19:32,317 INFO L78 Accepts]: Start accepts. Automaton has 18975 states and 59360 transitions. Word has length 79 [2019-12-19 05:19:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:32,317 INFO L462 AbstractCegarLoop]: Abstraction has 18975 states and 59360 transitions. [2019-12-19 05:19:32,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 18975 states and 59360 transitions. [2019-12-19 05:19:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:32,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:32,336 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] [2019-12-19 05:19:32,336 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:32,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1580742388, now seen corresponding path program 1 times [2019-12-19 05:19:32,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:32,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008062035] [2019-12-19 05:19:32,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:32,413 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 05:19:32,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008062035] [2019-12-19 05:19:32,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:32,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:19:32,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682505997] [2019-12-19 05:19:32,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:19:32,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:19:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:19:32,416 INFO L87 Difference]: Start difference. First operand 18975 states and 59360 transitions. Second operand 8 states. [2019-12-19 05:19:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:35,482 INFO L93 Difference]: Finished difference Result 52657 states and 160091 transitions. [2019-12-19 05:19:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 05:19:35,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-19 05:19:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:35,564 INFO L225 Difference]: With dead ends: 52657 [2019-12-19 05:19:35,564 INFO L226 Difference]: Without dead ends: 52240 [2019-12-19 05:19:35,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-19 05:19:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52240 states. [2019-12-19 05:19:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52240 to 28682. [2019-12-19 05:19:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28682 states. [2019-12-19 05:19:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28682 states to 28682 states and 89258 transitions. [2019-12-19 05:19:36,086 INFO L78 Accepts]: Start accepts. Automaton has 28682 states and 89258 transitions. Word has length 80 [2019-12-19 05:19:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:36,086 INFO L462 AbstractCegarLoop]: Abstraction has 28682 states and 89258 transitions. [2019-12-19 05:19:36,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:19:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 28682 states and 89258 transitions. [2019-12-19 05:19:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:36,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:36,114 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] [2019-12-19 05:19:36,114 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:36,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:36,114 INFO L82 PathProgramCache]: Analyzing trace with hash -507846410, now seen corresponding path program 1 times [2019-12-19 05:19:36,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:36,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563075215] [2019-12-19 05:19:36,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:36,214 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 05:19:36,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563075215] [2019-12-19 05:19:36,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:36,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:36,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180120663] [2019-12-19 05:19:36,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:36,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:36,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:36,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:36,217 INFO L87 Difference]: Start difference. First operand 28682 states and 89258 transitions. Second operand 6 states. [2019-12-19 05:19:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:36,773 INFO L93 Difference]: Finished difference Result 30407 states and 93751 transitions. [2019-12-19 05:19:36,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:36,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 05:19:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:36,819 INFO L225 Difference]: With dead ends: 30407 [2019-12-19 05:19:36,819 INFO L226 Difference]: Without dead ends: 30407 [2019-12-19 05:19:36,819 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 05:19:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30407 states. [2019-12-19 05:19:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30407 to 29149. [2019-12-19 05:19:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29149 states. [2019-12-19 05:19:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29149 states to 29149 states and 90160 transitions. [2019-12-19 05:19:37,216 INFO L78 Accepts]: Start accepts. Automaton has 29149 states and 90160 transitions. Word has length 80 [2019-12-19 05:19:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:37,216 INFO L462 AbstractCegarLoop]: Abstraction has 29149 states and 90160 transitions. [2019-12-19 05:19:37,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 29149 states and 90160 transitions. [2019-12-19 05:19:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:37,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:37,242 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] [2019-12-19 05:19:37,242 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:37,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1851460599, now seen corresponding path program 1 times [2019-12-19 05:19:37,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:37,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019754142] [2019-12-19 05:19:37,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:37,339 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 05:19:37,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019754142] [2019-12-19 05:19:37,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:37,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:37,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851034845] [2019-12-19 05:19:37,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:37,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:37,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:37,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:37,341 INFO L87 Difference]: Start difference. First operand 29149 states and 90160 transitions. Second operand 7 states. [2019-12-19 05:19:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:37,977 INFO L93 Difference]: Finished difference Result 30834 states and 94868 transitions. [2019-12-19 05:19:37,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:19:37,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-19 05:19:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:38,244 INFO L225 Difference]: With dead ends: 30834 [2019-12-19 05:19:38,244 INFO L226 Difference]: Without dead ends: 30834 [2019-12-19 05:19:38,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 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 05:19:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30834 states. [2019-12-19 05:19:38,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30834 to 29512. [2019-12-19 05:19:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29512 states. [2019-12-19 05:19:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29512 states to 29512 states and 91025 transitions. [2019-12-19 05:19:38,629 INFO L78 Accepts]: Start accepts. Automaton has 29512 states and 91025 transitions. Word has length 80 [2019-12-19 05:19:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:38,629 INFO L462 AbstractCegarLoop]: Abstraction has 29512 states and 91025 transitions. [2019-12-19 05:19:38,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 29512 states and 91025 transitions. [2019-12-19 05:19:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:38,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:38,658 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] [2019-12-19 05:19:38,658 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2113740936, now seen corresponding path program 1 times [2019-12-19 05:19:38,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:38,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406202273] [2019-12-19 05:19:38,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:38,707 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 05:19:38,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406202273] [2019-12-19 05:19:38,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:38,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:38,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635087876] [2019-12-19 05:19:38,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:38,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:38,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:38,709 INFO L87 Difference]: Start difference. First operand 29512 states and 91025 transitions. Second operand 3 states. [2019-12-19 05:19:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:38,825 INFO L93 Difference]: Finished difference Result 22465 states and 68730 transitions. [2019-12-19 05:19:38,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:38,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-19 05:19:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:38,869 INFO L225 Difference]: With dead ends: 22465 [2019-12-19 05:19:38,870 INFO L226 Difference]: Without dead ends: 22465 [2019-12-19 05:19:38,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 05:19:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22465 states. [2019-12-19 05:19:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22465 to 21651. [2019-12-19 05:19:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21651 states. [2019-12-19 05:19:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21651 states to 21651 states and 66414 transitions. [2019-12-19 05:19:39,215 INFO L78 Accepts]: Start accepts. Automaton has 21651 states and 66414 transitions. Word has length 80 [2019-12-19 05:19:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:39,216 INFO L462 AbstractCegarLoop]: Abstraction has 21651 states and 66414 transitions. [2019-12-19 05:19:39,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 21651 states and 66414 transitions. [2019-12-19 05:19:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:39,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:39,237 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] [2019-12-19 05:19:39,237 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1936604585, now seen corresponding path program 1 times [2019-12-19 05:19:39,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:39,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121385405] [2019-12-19 05:19:39,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:39,330 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 05:19:39,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121385405] [2019-12-19 05:19:39,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:39,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:39,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570045442] [2019-12-19 05:19:39,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:39,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:39,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:39,338 INFO L87 Difference]: Start difference. First operand 21651 states and 66414 transitions. Second operand 7 states. [2019-12-19 05:19:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:40,025 INFO L93 Difference]: Finished difference Result 39045 states and 119676 transitions. [2019-12-19 05:19:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:19:40,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-19 05:19:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:40,085 INFO L225 Difference]: With dead ends: 39045 [2019-12-19 05:19:40,085 INFO L226 Difference]: Without dead ends: 39045 [2019-12-19 05:19:40,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:19:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39045 states. [2019-12-19 05:19:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39045 to 23068. [2019-12-19 05:19:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23068 states. [2019-12-19 05:19:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23068 states to 23068 states and 70714 transitions. [2019-12-19 05:19:40,734 INFO L78 Accepts]: Start accepts. Automaton has 23068 states and 70714 transitions. Word has length 80 [2019-12-19 05:19:40,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:40,734 INFO L462 AbstractCegarLoop]: Abstraction has 23068 states and 70714 transitions. [2019-12-19 05:19:40,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 23068 states and 70714 transitions. [2019-12-19 05:19:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:40,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:40,754 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] [2019-12-19 05:19:40,757 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash -632881814, now seen corresponding path program 1 times [2019-12-19 05:19:40,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:40,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675132729] [2019-12-19 05:19:40,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:40,839 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 05:19:40,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675132729] [2019-12-19 05:19:40,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:40,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:40,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812556825] [2019-12-19 05:19:40,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:40,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:40,841 INFO L87 Difference]: Start difference. First operand 23068 states and 70714 transitions. Second operand 5 states. [2019-12-19 05:19:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:40,881 INFO L93 Difference]: Finished difference Result 3274 states and 8033 transitions. [2019-12-19 05:19:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:19:40,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 05:19:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:40,886 INFO L225 Difference]: With dead ends: 3274 [2019-12-19 05:19:40,887 INFO L226 Difference]: Without dead ends: 2815 [2019-12-19 05:19:40,887 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 05:19:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2019-12-19 05:19:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2541. [2019-12-19 05:19:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-12-19 05:19:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 6203 transitions. [2019-12-19 05:19:40,929 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 6203 transitions. Word has length 80 [2019-12-19 05:19:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:40,929 INFO L462 AbstractCegarLoop]: Abstraction has 2541 states and 6203 transitions. [2019-12-19 05:19:40,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 6203 transitions. [2019-12-19 05:19:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:40,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:40,934 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] [2019-12-19 05:19:40,934 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash 211784789, now seen corresponding path program 1 times [2019-12-19 05:19:40,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:40,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521092248] [2019-12-19 05:19:40,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:41,003 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 05:19:41,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521092248] [2019-12-19 05:19:41,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:41,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:41,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271863855] [2019-12-19 05:19:41,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:41,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:41,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:41,005 INFO L87 Difference]: Start difference. First operand 2541 states and 6203 transitions. Second operand 6 states. [2019-12-19 05:19:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:41,283 INFO L93 Difference]: Finished difference Result 3131 states and 7603 transitions. [2019-12-19 05:19:41,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:41,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:19:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:41,289 INFO L225 Difference]: With dead ends: 3131 [2019-12-19 05:19:41,289 INFO L226 Difference]: Without dead ends: 3113 [2019-12-19 05:19:41,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 05:19:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2019-12-19 05:19:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2790. [2019-12-19 05:19:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-12-19 05:19:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 6803 transitions. [2019-12-19 05:19:41,317 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 6803 transitions. Word has length 92 [2019-12-19 05:19:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:41,318 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 6803 transitions. [2019-12-19 05:19:41,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 6803 transitions. [2019-12-19 05:19:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:41,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:41,321 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] [2019-12-19 05:19:41,321 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:41,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:41,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1173398806, now seen corresponding path program 1 times [2019-12-19 05:19:41,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:41,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840317608] [2019-12-19 05:19:41,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:41,427 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 05:19:41,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840317608] [2019-12-19 05:19:41,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:41,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:41,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227020269] [2019-12-19 05:19:41,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:41,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:41,430 INFO L87 Difference]: Start difference. First operand 2790 states and 6803 transitions. Second operand 6 states. [2019-12-19 05:19:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:41,780 INFO L93 Difference]: Finished difference Result 2990 states and 7156 transitions. [2019-12-19 05:19:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:41,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:19:41,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:41,786 INFO L225 Difference]: With dead ends: 2990 [2019-12-19 05:19:41,786 INFO L226 Difference]: Without dead ends: 2938 [2019-12-19 05:19:41,786 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 05:19:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2019-12-19 05:19:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2881. [2019-12-19 05:19:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-12-19 05:19:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 6969 transitions. [2019-12-19 05:19:41,827 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 6969 transitions. Word has length 92 [2019-12-19 05:19:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:41,828 INFO L462 AbstractCegarLoop]: Abstraction has 2881 states and 6969 transitions. [2019-12-19 05:19:41,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 6969 transitions. [2019-12-19 05:19:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:41,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:41,833 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] [2019-12-19 05:19:41,833 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash 738198895, now seen corresponding path program 1 times [2019-12-19 05:19:41,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:41,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918738913] [2019-12-19 05:19:41,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:41,905 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 05:19:41,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918738913] [2019-12-19 05:19:41,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:41,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:41,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384018061] [2019-12-19 05:19:41,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:41,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:41,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:41,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:41,908 INFO L87 Difference]: Start difference. First operand 2881 states and 6969 transitions. Second operand 4 states. [2019-12-19 05:19:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:41,943 INFO L93 Difference]: Finished difference Result 2703 states and 6512 transitions. [2019-12-19 05:19:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:19:41,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-19 05:19:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:41,947 INFO L225 Difference]: With dead ends: 2703 [2019-12-19 05:19:41,947 INFO L226 Difference]: Without dead ends: 2703 [2019-12-19 05:19:41,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 05:19:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-12-19 05:19:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2624. [2019-12-19 05:19:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-12-19 05:19:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 6310 transitions. [2019-12-19 05:19:41,985 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 6310 transitions. Word has length 92 [2019-12-19 05:19:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:41,985 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 6310 transitions. [2019-12-19 05:19:41,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 6310 transitions. [2019-12-19 05:19:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:41,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:41,989 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] [2019-12-19 05:19:41,989 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:41,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1220152845, now seen corresponding path program 1 times [2019-12-19 05:19:41,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:41,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170092709] [2019-12-19 05:19:41,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:42,058 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 05:19:42,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170092709] [2019-12-19 05:19:42,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:42,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:42,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477456161] [2019-12-19 05:19:42,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:42,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:42,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:42,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:42,060 INFO L87 Difference]: Start difference. First operand 2624 states and 6310 transitions. Second operand 5 states. [2019-12-19 05:19:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:42,317 INFO L93 Difference]: Finished difference Result 3041 states and 7197 transitions. [2019-12-19 05:19:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:42,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 05:19:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:42,323 INFO L225 Difference]: With dead ends: 3041 [2019-12-19 05:19:42,323 INFO L226 Difference]: Without dead ends: 3015 [2019-12-19 05:19:42,324 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 05:19:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2019-12-19 05:19:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2695. [2019-12-19 05:19:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-12-19 05:19:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 6452 transitions. [2019-12-19 05:19:42,378 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 6452 transitions. Word has length 92 [2019-12-19 05:19:42,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:42,378 INFO L462 AbstractCegarLoop]: Abstraction has 2695 states and 6452 transitions. [2019-12-19 05:19:42,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 6452 transitions. [2019-12-19 05:19:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:42,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:42,383 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] [2019-12-19 05:19:42,384 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash -947481435, now seen corresponding path program 2 times [2019-12-19 05:19:42,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:42,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568199512] [2019-12-19 05:19:42,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:42,547 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 05:19:42,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568199512] [2019-12-19 05:19:42,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:42,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:42,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585428271] [2019-12-19 05:19:42,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:42,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:42,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:42,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:42,550 INFO L87 Difference]: Start difference. First operand 2695 states and 6452 transitions. Second operand 7 states. [2019-12-19 05:19:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:42,949 INFO L93 Difference]: Finished difference Result 3871 states and 9108 transitions. [2019-12-19 05:19:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 05:19:42,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:19:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:42,955 INFO L225 Difference]: With dead ends: 3871 [2019-12-19 05:19:42,955 INFO L226 Difference]: Without dead ends: 3853 [2019-12-19 05:19:42,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:19:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-12-19 05:19:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3378. [2019-12-19 05:19:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3378 states. [2019-12-19 05:19:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 7977 transitions. [2019-12-19 05:19:42,991 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 7977 transitions. Word has length 92 [2019-12-19 05:19:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:42,991 INFO L462 AbstractCegarLoop]: Abstraction has 3378 states and 7977 transitions. [2019-12-19 05:19:42,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 7977 transitions. [2019-12-19 05:19:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:42,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:42,995 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] [2019-12-19 05:19:42,995 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash 14132582, now seen corresponding path program 1 times [2019-12-19 05:19:42,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:42,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447305279] [2019-12-19 05:19:42,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:43,078 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 05:19:43,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447305279] [2019-12-19 05:19:43,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:43,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:43,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552886918] [2019-12-19 05:19:43,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:43,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:43,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:43,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:43,081 INFO L87 Difference]: Start difference. First operand 3378 states and 7977 transitions. Second operand 7 states. [2019-12-19 05:19:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:43,429 INFO L93 Difference]: Finished difference Result 4287 states and 10155 transitions. [2019-12-19 05:19:43,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:19:43,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:19:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:43,436 INFO L225 Difference]: With dead ends: 4287 [2019-12-19 05:19:43,436 INFO L226 Difference]: Without dead ends: 4287 [2019-12-19 05:19:43,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-19 05:19:43,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-12-19 05:19:43,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3600. [2019-12-19 05:19:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3600 states. [2019-12-19 05:19:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 8531 transitions. [2019-12-19 05:19:43,474 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 8531 transitions. Word has length 92 [2019-12-19 05:19:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:43,474 INFO L462 AbstractCegarLoop]: Abstraction has 3600 states and 8531 transitions. [2019-12-19 05:19:43,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 8531 transitions. [2019-12-19 05:19:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:43,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:43,477 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] [2019-12-19 05:19:43,478 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1258897063, now seen corresponding path program 1 times [2019-12-19 05:19:43,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:43,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382694143] [2019-12-19 05:19:43,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:43,575 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 05:19:43,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382694143] [2019-12-19 05:19:43,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:43,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:43,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812603936] [2019-12-19 05:19:43,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:43,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:43,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:43,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:43,577 INFO L87 Difference]: Start difference. First operand 3600 states and 8531 transitions. Second operand 6 states. [2019-12-19 05:19:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:43,914 INFO L93 Difference]: Finished difference Result 3968 states and 9363 transitions. [2019-12-19 05:19:43,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:19:43,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:19:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:43,921 INFO L225 Difference]: With dead ends: 3968 [2019-12-19 05:19:43,921 INFO L226 Difference]: Without dead ends: 3968 [2019-12-19 05:19:43,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-12-19 05:19:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3572. [2019-12-19 05:19:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-12-19 05:19:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 8475 transitions. [2019-12-19 05:19:43,991 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 8475 transitions. Word has length 92 [2019-12-19 05:19:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:43,991 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 8475 transitions. [2019-12-19 05:19:43,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 8475 transitions. [2019-12-19 05:19:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:43,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:43,998 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] [2019-12-19 05:19:43,998 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1311094677, now seen corresponding path program 1 times [2019-12-19 05:19:43,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:43,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65187179] [2019-12-19 05:19:43,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:44,132 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 05:19:44,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65187179] [2019-12-19 05:19:44,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:44,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:44,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960449535] [2019-12-19 05:19:44,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:44,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:44,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:44,134 INFO L87 Difference]: Start difference. First operand 3572 states and 8475 transitions. Second operand 6 states. [2019-12-19 05:19:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:44,331 INFO L93 Difference]: Finished difference Result 4056 states and 9312 transitions. [2019-12-19 05:19:44,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:19:44,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:19:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:44,337 INFO L225 Difference]: With dead ends: 4056 [2019-12-19 05:19:44,337 INFO L226 Difference]: Without dead ends: 4056 [2019-12-19 05:19:44,339 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 05:19:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-19 05:19:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3770. [2019-12-19 05:19:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3770 states. [2019-12-19 05:19:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 8757 transitions. [2019-12-19 05:19:44,394 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 8757 transitions. Word has length 92 [2019-12-19 05:19:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:44,394 INFO L462 AbstractCegarLoop]: Abstraction has 3770 states and 8757 transitions. [2019-12-19 05:19:44,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:44,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 8757 transitions. [2019-12-19 05:19:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:44,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:44,400 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] [2019-12-19 05:19:44,400 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1187021430, now seen corresponding path program 1 times [2019-12-19 05:19:44,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:44,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700711242] [2019-12-19 05:19:44,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:44,537 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 05:19:44,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700711242] [2019-12-19 05:19:44,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:44,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:19:44,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190433210] [2019-12-19 05:19:44,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:19:44,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:44,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:19:44,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:19:44,539 INFO L87 Difference]: Start difference. First operand 3770 states and 8757 transitions. Second operand 8 states. [2019-12-19 05:19:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:45,076 INFO L93 Difference]: Finished difference Result 4626 states and 10717 transitions. [2019-12-19 05:19:45,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:19:45,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-12-19 05:19:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:45,083 INFO L225 Difference]: With dead ends: 4626 [2019-12-19 05:19:45,083 INFO L226 Difference]: Without dead ends: 4608 [2019-12-19 05:19:45,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-19 05:19:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2019-12-19 05:19:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3251. [2019-12-19 05:19:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3251 states. [2019-12-19 05:19:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 7643 transitions. [2019-12-19 05:19:45,139 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 7643 transitions. Word has length 92 [2019-12-19 05:19:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:45,140 INFO L462 AbstractCegarLoop]: Abstraction has 3251 states and 7643 transitions. [2019-12-19 05:19:45,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:19:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 7643 transitions. [2019-12-19 05:19:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:45,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:45,144 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] [2019-12-19 05:19:45,144 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1019357068, now seen corresponding path program 1 times [2019-12-19 05:19:45,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:45,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731007721] [2019-12-19 05:19:45,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:45,330 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 05:19:45,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731007721] [2019-12-19 05:19:45,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:45,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:45,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6178075] [2019-12-19 05:19:45,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:45,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:45,333 INFO L87 Difference]: Start difference. First operand 3251 states and 7643 transitions. Second operand 5 states. [2019-12-19 05:19:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:45,394 INFO L93 Difference]: Finished difference Result 4760 states and 11424 transitions. [2019-12-19 05:19:45,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:19:45,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 05:19:45,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:45,405 INFO L225 Difference]: With dead ends: 4760 [2019-12-19 05:19:45,405 INFO L226 Difference]: Without dead ends: 4760 [2019-12-19 05:19:45,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2019-12-19 05:19:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 2893. [2019-12-19 05:19:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2019-12-19 05:19:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 6764 transitions. [2019-12-19 05:19:45,486 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 6764 transitions. Word has length 92 [2019-12-19 05:19:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:45,487 INFO L462 AbstractCegarLoop]: Abstraction has 2893 states and 6764 transitions. [2019-12-19 05:19:45,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 6764 transitions. [2019-12-19 05:19:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:45,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:45,492 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] [2019-12-19 05:19:45,493 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:45,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:45,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1500073484, now seen corresponding path program 1 times [2019-12-19 05:19:45,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:45,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87663165] [2019-12-19 05:19:45,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:45,641 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 05:19:45,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87663165] [2019-12-19 05:19:45,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:45,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:45,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451957469] [2019-12-19 05:19:45,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:45,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:45,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:45,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:45,644 INFO L87 Difference]: Start difference. First operand 2893 states and 6764 transitions. Second operand 6 states. [2019-12-19 05:19:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:45,919 INFO L93 Difference]: Finished difference Result 2650 states and 6062 transitions. [2019-12-19 05:19:45,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:19:45,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:19:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:45,925 INFO L225 Difference]: With dead ends: 2650 [2019-12-19 05:19:45,925 INFO L226 Difference]: Without dead ends: 2650 [2019-12-19 05:19:45,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:19:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2019-12-19 05:19:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2018. [2019-12-19 05:19:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-12-19 05:19:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 4736 transitions. [2019-12-19 05:19:45,971 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 4736 transitions. Word has length 92 [2019-12-19 05:19:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:45,972 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 4736 transitions. [2019-12-19 05:19:45,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 4736 transitions. [2019-12-19 05:19:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:45,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:45,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:45,977 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash -572704409, now seen corresponding path program 1 times [2019-12-19 05:19:45,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:45,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797234051] [2019-12-19 05:19:45,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:46,085 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 05:19:46,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797234051] [2019-12-19 05:19:46,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:46,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:46,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930881214] [2019-12-19 05:19:46,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:46,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:46,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:46,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:46,088 INFO L87 Difference]: Start difference. First operand 2018 states and 4736 transitions. Second operand 5 states. [2019-12-19 05:19:46,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:46,355 INFO L93 Difference]: Finished difference Result 2270 states and 5315 transitions. [2019-12-19 05:19:46,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:19:46,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:19:46,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:46,358 INFO L225 Difference]: With dead ends: 2270 [2019-12-19 05:19:46,359 INFO L226 Difference]: Without dead ends: 2252 [2019-12-19 05:19:46,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2019-12-19 05:19:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2045. [2019-12-19 05:19:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-19 05:19:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4790 transitions. [2019-12-19 05:19:46,390 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4790 transitions. Word has length 94 [2019-12-19 05:19:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:46,390 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4790 transitions. [2019-12-19 05:19:46,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4790 transitions. [2019-12-19 05:19:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:46,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:46,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:46,394 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash 672060072, now seen corresponding path program 1 times [2019-12-19 05:19:46,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:46,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902594177] [2019-12-19 05:19:46,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:46,560 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 05:19:46,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902594177] [2019-12-19 05:19:46,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:46,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-19 05:19:46,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809540525] [2019-12-19 05:19:46,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-19 05:19:46,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:46,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-19 05:19:46,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:19:46,564 INFO L87 Difference]: Start difference. First operand 2045 states and 4790 transitions. Second operand 12 states. [2019-12-19 05:19:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:46,890 INFO L93 Difference]: Finished difference Result 3214 states and 7655 transitions. [2019-12-19 05:19:46,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 05:19:46,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-12-19 05:19:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:46,895 INFO L225 Difference]: With dead ends: 3214 [2019-12-19 05:19:46,896 INFO L226 Difference]: Without dead ends: 2575 [2019-12-19 05:19:46,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-12-19 05:19:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-12-19 05:19:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2463. [2019-12-19 05:19:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-19 05:19:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5707 transitions. [2019-12-19 05:19:46,945 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5707 transitions. Word has length 94 [2019-12-19 05:19:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:46,946 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5707 transitions. [2019-12-19 05:19:46,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-19 05:19:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5707 transitions. [2019-12-19 05:19:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:46,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:46,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:46,951 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash 718924530, now seen corresponding path program 2 times [2019-12-19 05:19:46,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:46,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041510861] [2019-12-19 05:19:46,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:19:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:19:47,139 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 05:19:47,140 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 05:19:47,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:19:47 BasicIcfg [2019-12-19 05:19:47,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 05:19:47,387 INFO L168 Benchmark]: Toolchain (without parser) took 63666.15 ms. Allocated memory was 138.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 101.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 989.6 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:47,387 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 05:19:47,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.26 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 158.7 MB in the end (delta: -57.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:47,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.56 ms. Allocated memory is still 203.9 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:47,389 INFO L168 Benchmark]: Boogie Preprocessor took 38.82 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:47,389 INFO L168 Benchmark]: RCFGBuilder took 762.06 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 109.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:47,390 INFO L168 Benchmark]: TraceAbstraction took 62038.70 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 109.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 932.0 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:47,393 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.26 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 158.7 MB in the end (delta: -57.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.56 ms. Allocated memory is still 203.9 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.82 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 762.06 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 109.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62038.70 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 109.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 932.0 MB. 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] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L700] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L701] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L702] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L703] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L704] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L705] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L706] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L707] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L708] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L709] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L710] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L711] 0 int y$w_buff0; VAL [__unbuffered_cnt=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] [L712] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L713] 0 int y$w_buff1; VAL [__unbuffered_cnt=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] [L714] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L776] 0 pthread_t t2473; VAL [__unbuffered_cnt=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] [L777] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L720] 1 y$w_buff1 = y$w_buff0 [L721] 1 y$w_buff0 = 2 [L722] 1 y$w_buff1_used = y$w_buff0_used [L723] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 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) [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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=2] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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=2] [L736] 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 [L754] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L754] 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) [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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] [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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] [L737] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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] [L738] 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 [L741] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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] [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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] [L756] 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 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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] [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, 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] [L758] 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 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 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) [L786] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 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 [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 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 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y = y$flush_delayed ? y$mem_tmp : y [L805] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.6s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10100 SDtfs, 10338 SDslu, 24185 SDs, 0 SdLazy, 11145 SolverSat, 657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 108 SyntacticMatches, 18 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76085occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 153176 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2914 NumberOfCodeBlocks, 2914 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2783 ConstructedInterpolants, 0 QuantifiedInterpolants, 526567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...