/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 01:54:52,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 01:54:52,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 01:54:52,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 01:54:52,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 01:54:52,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 01:54:52,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 01:54:52,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 01:54:52,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 01:54:52,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 01:54:52,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 01:54:52,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 01:54:52,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 01:54:52,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 01:54:52,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 01:54:52,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 01:54:52,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 01:54:52,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 01:54:52,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 01:54:52,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 01:54:52,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 01:54:52,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 01:54:52,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 01:54:52,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 01:54:52,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 01:54:52,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 01:54:52,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 01:54:52,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 01:54:52,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 01:54:52,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 01:54:52,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 01:54:52,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 01:54:52,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 01:54:52,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 01:54:52,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 01:54:52,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 01:54:52,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 01:54:52,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 01:54:52,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 01:54:52,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 01:54:52,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 01:54:52,446 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-MCR.epf [2019-12-28 01:54:52,465 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 01:54:52,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 01:54:52,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 01:54:52,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 01:54:52,468 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 01:54:52,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 01:54:52,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 01:54:52,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 01:54:52,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 01:54:52,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 01:54:52,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 01:54:52,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 01:54:52,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 01:54:52,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 01:54:52,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 01:54:52,470 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 01:54:52,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 01:54:52,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 01:54:52,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 01:54:52,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 01:54:52,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 01:54:52,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 01:54:52,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 01:54:52,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 01:54:52,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 01:54:52,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 01:54:52,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 01:54:52,473 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 01:54:52,473 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 01:54:52,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 01:54:52,473 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 01:54:52,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 01:54:52,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 01:54:52,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 01:54:52,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 01:54:52,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 01:54:52,783 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 01:54:52,783 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-28 01:54:52,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb3d5a03/d4ec25957cd44a3782d1358d71eab90b/FLAGf757a2d1a [2019-12-28 01:54:53,409 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 01:54:53,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-28 01:54:53,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb3d5a03/d4ec25957cd44a3782d1358d71eab90b/FLAGf757a2d1a [2019-12-28 01:54:53,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb3d5a03/d4ec25957cd44a3782d1358d71eab90b [2019-12-28 01:54:53,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 01:54:53,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 01:54:53,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 01:54:53,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 01:54:53,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 01:54:53,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:54:53" (1/1) ... [2019-12-28 01:54:53,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce86a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:53, skipping insertion in model container [2019-12-28 01:54:53,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:54:53" (1/1) ... [2019-12-28 01:54:53,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 01:54:53,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 01:54:54,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:54:54,296 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 01:54:54,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:54:54,523 INFO L208 MainTranslator]: Completed translation [2019-12-28 01:54:54,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54 WrapperNode [2019-12-28 01:54:54,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 01:54:54,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 01:54:54,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 01:54:54,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 01:54:54,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (1/1) ... [2019-12-28 01:54:54,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (1/1) ... [2019-12-28 01:54:54,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 01:54:54,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 01:54:54,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 01:54:54,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 01:54:54,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (1/1) ... [2019-12-28 01:54:54,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (1/1) ... [2019-12-28 01:54:54,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (1/1) ... [2019-12-28 01:54:54,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (1/1) ... [2019-12-28 01:54:54,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (1/1) ... [2019-12-28 01:54:54,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (1/1) ... [2019-12-28 01:54:54,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (1/1) ... [2019-12-28 01:54:54,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 01:54:54,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 01:54:54,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 01:54:54,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 01:54:54,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (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-28 01:54:54,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 01:54:54,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 01:54:54,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 01:54:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 01:54:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 01:54:54,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 01:54:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 01:54:54,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 01:54:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 01:54:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 01:54:54,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 01:54:54,795 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 01:54:55,730 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 01:54:55,731 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 01:54:55,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:54:55 BoogieIcfgContainer [2019-12-28 01:54:55,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 01:54:55,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 01:54:55,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 01:54:55,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 01:54:55,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:54:53" (1/3) ... [2019-12-28 01:54:55,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8d1995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:54:55, skipping insertion in model container [2019-12-28 01:54:55,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:54" (2/3) ... [2019-12-28 01:54:55,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8d1995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:54:55, skipping insertion in model container [2019-12-28 01:54:55,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:54:55" (3/3) ... [2019-12-28 01:54:55,742 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.oepc.i [2019-12-28 01:54:55,752 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 01:54:55,753 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 01:54:55,762 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 01:54:55,763 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 01:54:55,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,807 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,807 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,809 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,819 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,819 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,875 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,876 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,876 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:55,915 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 01:54:55,932 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 01:54:55,932 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 01:54:55,932 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 01:54:55,932 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 01:54:55,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 01:54:55,932 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 01:54:55,932 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 01:54:55,933 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 01:54:55,958 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 185 transitions [2019-12-28 01:54:57,764 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32595 states. [2019-12-28 01:54:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 32595 states. [2019-12-28 01:54:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-28 01:54:57,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:57,776 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] [2019-12-28 01:54:57,777 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1631155360, now seen corresponding path program 1 times [2019-12-28 01:54:57,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:57,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823695781] [2019-12-28 01:54:57,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:58,306 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-28 01:54:58,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823695781] [2019-12-28 01:54:58,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:58,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:54:58,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [107845120] [2019-12-28 01:54:58,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:58,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:58,336 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 38 transitions. [2019-12-28 01:54:58,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:58,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:58,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:54:58,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:58,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:54:58,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:54:58,359 INFO L87 Difference]: Start difference. First operand 32595 states. Second operand 4 states. [2019-12-28 01:54:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:59,114 INFO L93 Difference]: Finished difference Result 33595 states and 129572 transitions. [2019-12-28 01:54:59,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:54:59,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-28 01:54:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:00,308 INFO L225 Difference]: With dead ends: 33595 [2019-12-28 01:55:00,308 INFO L226 Difference]: Without dead ends: 25707 [2019-12-28 01:55:00,311 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-28 01:55:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25707 states. [2019-12-28 01:55:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25707 to 25707. [2019-12-28 01:55:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25707 states. [2019-12-28 01:55:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25707 states to 25707 states and 99588 transitions. [2019-12-28 01:55:01,655 INFO L78 Accepts]: Start accepts. Automaton has 25707 states and 99588 transitions. Word has length 38 [2019-12-28 01:55:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:01,657 INFO L462 AbstractCegarLoop]: Abstraction has 25707 states and 99588 transitions. [2019-12-28 01:55:01,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 25707 states and 99588 transitions. [2019-12-28 01:55:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 01:55:01,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:01,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:01,670 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash 475633161, now seen corresponding path program 1 times [2019-12-28 01:55:01,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:01,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853093065] [2019-12-28 01:55:01,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:01,833 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-28 01:55:01,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853093065] [2019-12-28 01:55:01,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:01,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:01,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [761467765] [2019-12-28 01:55:01,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:01,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:01,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 01:55:01,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:01,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:01,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:01,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:01,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:01,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:01,850 INFO L87 Difference]: Start difference. First operand 25707 states and 99588 transitions. Second operand 5 states. [2019-12-28 01:55:02,181 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-28 01:55:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:02,902 INFO L93 Difference]: Finished difference Result 41085 states and 150435 transitions. [2019-12-28 01:55:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:02,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-28 01:55:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:03,115 INFO L225 Difference]: With dead ends: 41085 [2019-12-28 01:55:03,116 INFO L226 Difference]: Without dead ends: 40549 [2019-12-28 01:55:03,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2019-12-28 01:55:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 38929. [2019-12-28 01:55:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38929 states. [2019-12-28 01:55:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38929 states to 38929 states and 143585 transitions. [2019-12-28 01:55:05,816 INFO L78 Accepts]: Start accepts. Automaton has 38929 states and 143585 transitions. Word has length 50 [2019-12-28 01:55:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:05,818 INFO L462 AbstractCegarLoop]: Abstraction has 38929 states and 143585 transitions. [2019-12-28 01:55:05,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38929 states and 143585 transitions. [2019-12-28 01:55:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 01:55:05,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:05,825 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-28 01:55:05,825 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1647317549, now seen corresponding path program 1 times [2019-12-28 01:55:05,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:05,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291981284] [2019-12-28 01:55:05,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:05,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291981284] [2019-12-28 01:55:05,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:05,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:05,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [220673046] [2019-12-28 01:55:05,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:05,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:05,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 51 transitions. [2019-12-28 01:55:05,924 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:05,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:05,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:05,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:05,925 INFO L87 Difference]: Start difference. First operand 38929 states and 143585 transitions. Second operand 5 states. [2019-12-28 01:55:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:08,124 INFO L93 Difference]: Finished difference Result 49782 states and 180637 transitions. [2019-12-28 01:55:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:08,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-28 01:55:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:08,337 INFO L225 Difference]: With dead ends: 49782 [2019-12-28 01:55:08,337 INFO L226 Difference]: Without dead ends: 49278 [2019-12-28 01:55:08,338 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-28 01:55:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49278 states. [2019-12-28 01:55:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49278 to 42681. [2019-12-28 01:55:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42681 states. [2019-12-28 01:55:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42681 states to 42681 states and 156596 transitions. [2019-12-28 01:55:09,735 INFO L78 Accepts]: Start accepts. Automaton has 42681 states and 156596 transitions. Word has length 51 [2019-12-28 01:55:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:09,736 INFO L462 AbstractCegarLoop]: Abstraction has 42681 states and 156596 transitions. [2019-12-28 01:55:09,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 42681 states and 156596 transitions. [2019-12-28 01:55:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:55:09,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:09,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:09,745 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1552968967, now seen corresponding path program 1 times [2019-12-28 01:55:09,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:09,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46231453] [2019-12-28 01:55:09,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:09,796 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-28 01:55:09,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46231453] [2019-12-28 01:55:09,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:09,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:55:09,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [297319794] [2019-12-28 01:55:09,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:09,804 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:09,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 01:55:09,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:09,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:09,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:55:09,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:55:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:09,815 INFO L87 Difference]: Start difference. First operand 42681 states and 156596 transitions. Second operand 3 states. [2019-12-28 01:55:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:10,120 INFO L93 Difference]: Finished difference Result 61091 states and 221434 transitions. [2019-12-28 01:55:10,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:55:10,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-28 01:55:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:10,744 INFO L225 Difference]: With dead ends: 61091 [2019-12-28 01:55:10,744 INFO L226 Difference]: Without dead ends: 61091 [2019-12-28 01:55:10,745 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-28 01:55:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61091 states. [2019-12-28 01:55:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61091 to 48020. [2019-12-28 01:55:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48020 states. [2019-12-28 01:55:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48020 states to 48020 states and 174183 transitions. [2019-12-28 01:55:13,927 INFO L78 Accepts]: Start accepts. Automaton has 48020 states and 174183 transitions. Word has length 53 [2019-12-28 01:55:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:13,927 INFO L462 AbstractCegarLoop]: Abstraction has 48020 states and 174183 transitions. [2019-12-28 01:55:13,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:55:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 48020 states and 174183 transitions. [2019-12-28 01:55:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:13,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:13,946 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] [2019-12-28 01:55:13,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1347337287, now seen corresponding path program 1 times [2019-12-28 01:55:13,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:13,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079668171] [2019-12-28 01:55:13,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:14,161 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-28 01:55:14,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079668171] [2019-12-28 01:55:14,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:14,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:14,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856234652] [2019-12-28 01:55:14,162 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:14,169 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:14,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 69 transitions. [2019-12-28 01:55:14,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:14,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:55:14,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:55:14,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:55:14,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:14,279 INFO L87 Difference]: Start difference. First operand 48020 states and 174183 transitions. Second operand 7 states. [2019-12-28 01:55:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:15,316 INFO L93 Difference]: Finished difference Result 63760 states and 229383 transitions. [2019-12-28 01:55:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:15,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-28 01:55:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:15,618 INFO L225 Difference]: With dead ends: 63760 [2019-12-28 01:55:15,619 INFO L226 Difference]: Without dead ends: 63760 [2019-12-28 01:55:15,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63760 states. [2019-12-28 01:55:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63760 to 59953. [2019-12-28 01:55:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59953 states. [2019-12-28 01:55:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59953 states to 59953 states and 215676 transitions. [2019-12-28 01:55:20,248 INFO L78 Accepts]: Start accepts. Automaton has 59953 states and 215676 transitions. Word has length 57 [2019-12-28 01:55:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:20,249 INFO L462 AbstractCegarLoop]: Abstraction has 59953 states and 215676 transitions. [2019-12-28 01:55:20,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:55:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 59953 states and 215676 transitions. [2019-12-28 01:55:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:20,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:20,285 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] [2019-12-28 01:55:20,285 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1150678650, now seen corresponding path program 1 times [2019-12-28 01:55:20,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:20,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521129877] [2019-12-28 01:55:20,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:20,400 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-28 01:55:20,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521129877] [2019-12-28 01:55:20,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:20,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:55:20,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [371954082] [2019-12-28 01:55:20,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:20,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:20,416 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 69 transitions. [2019-12-28 01:55:20,417 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:20,443 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:55:20,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:55:20,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:20,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:55:20,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:20,444 INFO L87 Difference]: Start difference. First operand 59953 states and 215676 transitions. Second operand 8 states. [2019-12-28 01:55:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:21,974 INFO L93 Difference]: Finished difference Result 83689 states and 290101 transitions. [2019-12-28 01:55:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:55:21,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-28 01:55:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:22,157 INFO L225 Difference]: With dead ends: 83689 [2019-12-28 01:55:22,158 INFO L226 Difference]: Without dead ends: 83689 [2019-12-28 01:55:22,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:55:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83689 states. [2019-12-28 01:55:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83689 to 71016. [2019-12-28 01:55:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71016 states. [2019-12-28 01:55:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71016 states to 71016 states and 249890 transitions. [2019-12-28 01:55:24,616 INFO L78 Accepts]: Start accepts. Automaton has 71016 states and 249890 transitions. Word has length 57 [2019-12-28 01:55:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:24,616 INFO L462 AbstractCegarLoop]: Abstraction has 71016 states and 249890 transitions. [2019-12-28 01:55:24,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:55:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 71016 states and 249890 transitions. [2019-12-28 01:55:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:24,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:24,634 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] [2019-12-28 01:55:24,635 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:24,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:24,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2038182331, now seen corresponding path program 1 times [2019-12-28 01:55:24,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:24,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636882852] [2019-12-28 01:55:24,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:24,704 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-28 01:55:24,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636882852] [2019-12-28 01:55:24,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:24,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:55:24,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1997705117] [2019-12-28 01:55:24,706 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:24,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:24,719 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 69 transitions. [2019-12-28 01:55:24,719 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:24,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:24,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:55:24,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:24,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:55:24,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:24,721 INFO L87 Difference]: Start difference. First operand 71016 states and 249890 transitions. Second operand 3 states. [2019-12-28 01:55:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:24,991 INFO L93 Difference]: Finished difference Result 54025 states and 188922 transitions. [2019-12-28 01:55:24,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:55:24,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-28 01:55:24,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:25,106 INFO L225 Difference]: With dead ends: 54025 [2019-12-28 01:55:25,106 INFO L226 Difference]: Without dead ends: 54025 [2019-12-28 01:55:25,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54025 states. [2019-12-28 01:55:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54025 to 53410. [2019-12-28 01:55:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53410 states. [2019-12-28 01:55:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53410 states to 53410 states and 187041 transitions. [2019-12-28 01:55:28,935 INFO L78 Accepts]: Start accepts. Automaton has 53410 states and 187041 transitions. Word has length 57 [2019-12-28 01:55:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:28,935 INFO L462 AbstractCegarLoop]: Abstraction has 53410 states and 187041 transitions. [2019-12-28 01:55:28,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:55:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 53410 states and 187041 transitions. [2019-12-28 01:55:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:28,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:28,944 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] [2019-12-28 01:55:28,945 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:28,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:28,945 INFO L82 PathProgramCache]: Analyzing trace with hash -565356220, now seen corresponding path program 1 times [2019-12-28 01:55:28,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:28,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496120366] [2019-12-28 01:55:28,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:29,057 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-28 01:55:29,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496120366] [2019-12-28 01:55:29,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:29,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:29,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1337512581] [2019-12-28 01:55:29,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:29,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:29,070 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-28 01:55:29,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:29,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:29,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:29,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:29,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:29,071 INFO L87 Difference]: Start difference. First operand 53410 states and 187041 transitions. Second operand 6 states. [2019-12-28 01:55:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:29,803 INFO L93 Difference]: Finished difference Result 68650 states and 237305 transitions. [2019-12-28 01:55:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:55:29,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-28 01:55:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:29,946 INFO L225 Difference]: With dead ends: 68650 [2019-12-28 01:55:29,947 INFO L226 Difference]: Without dead ends: 68082 [2019-12-28 01:55:29,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:55:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68082 states. [2019-12-28 01:55:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68082 to 53494. [2019-12-28 01:55:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53494 states. [2019-12-28 01:55:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53494 states to 53494 states and 187738 transitions. [2019-12-28 01:55:31,381 INFO L78 Accepts]: Start accepts. Automaton has 53494 states and 187738 transitions. Word has length 57 [2019-12-28 01:55:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:31,381 INFO L462 AbstractCegarLoop]: Abstraction has 53494 states and 187738 transitions. [2019-12-28 01:55:31,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 53494 states and 187738 transitions. [2019-12-28 01:55:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-28 01:55:31,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:31,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] [2019-12-28 01:55:31,393 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:31,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1699947683, now seen corresponding path program 1 times [2019-12-28 01:55:31,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:31,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551618924] [2019-12-28 01:55:31,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:31,501 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-28 01:55:31,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551618924] [2019-12-28 01:55:31,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:31,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:31,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1876368108] [2019-12-28 01:55:31,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:31,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:31,516 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-28 01:55:31,517 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:31,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:31,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:31,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:31,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:31,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:31,519 INFO L87 Difference]: Start difference. First operand 53494 states and 187738 transitions. Second operand 6 states. [2019-12-28 01:55:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:32,333 INFO L93 Difference]: Finished difference Result 67853 states and 231364 transitions. [2019-12-28 01:55:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:32,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-28 01:55:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:32,476 INFO L225 Difference]: With dead ends: 67853 [2019-12-28 01:55:32,476 INFO L226 Difference]: Without dead ends: 67853 [2019-12-28 01:55:32,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67853 states. [2019-12-28 01:55:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67853 to 59085. [2019-12-28 01:55:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59085 states. [2019-12-28 01:55:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59085 states to 59085 states and 204134 transitions. [2019-12-28 01:55:34,167 INFO L78 Accepts]: Start accepts. Automaton has 59085 states and 204134 transitions. Word has length 58 [2019-12-28 01:55:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:34,167 INFO L462 AbstractCegarLoop]: Abstraction has 59085 states and 204134 transitions. [2019-12-28 01:55:34,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 59085 states and 204134 transitions. [2019-12-28 01:55:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-28 01:55:34,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:34,177 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-28 01:55:34,177 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash -812444002, now seen corresponding path program 1 times [2019-12-28 01:55:34,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:34,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496328713] [2019-12-28 01:55:34,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:34,251 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-28 01:55:34,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496328713] [2019-12-28 01:55:34,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:34,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:34,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666738064] [2019-12-28 01:55:34,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:34,258 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:34,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-28 01:55:34,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:34,265 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:34,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:34,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:34,266 INFO L87 Difference]: Start difference. First operand 59085 states and 204134 transitions. Second operand 4 states. [2019-12-28 01:55:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:34,333 INFO L93 Difference]: Finished difference Result 10216 states and 31250 transitions. [2019-12-28 01:55:34,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:34,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-28 01:55:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:34,355 INFO L225 Difference]: With dead ends: 10216 [2019-12-28 01:55:34,356 INFO L226 Difference]: Without dead ends: 8511 [2019-12-28 01:55:34,356 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-28 01:55:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8511 states. [2019-12-28 01:55:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8511 to 8463. [2019-12-28 01:55:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8463 states. [2019-12-28 01:55:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 25329 transitions. [2019-12-28 01:55:34,552 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 25329 transitions. Word has length 58 [2019-12-28 01:55:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:34,552 INFO L462 AbstractCegarLoop]: Abstraction has 8463 states and 25329 transitions. [2019-12-28 01:55:34,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 25329 transitions. [2019-12-28 01:55:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:55:34,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:34,558 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-28 01:55:34,559 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1292079072, now seen corresponding path program 1 times [2019-12-28 01:55:34,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:34,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286649895] [2019-12-28 01:55:34,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:34,656 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-28 01:55:34,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286649895] [2019-12-28 01:55:34,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:34,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:34,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164734072] [2019-12-28 01:55:34,658 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:34,672 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:34,686 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 65 transitions. [2019-12-28 01:55:34,686 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:34,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:34,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:34,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:34,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:34,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:34,688 INFO L87 Difference]: Start difference. First operand 8463 states and 25329 transitions. Second operand 4 states. [2019-12-28 01:55:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:34,840 INFO L93 Difference]: Finished difference Result 9710 states and 29108 transitions. [2019-12-28 01:55:34,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:34,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-28 01:55:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:34,858 INFO L225 Difference]: With dead ends: 9710 [2019-12-28 01:55:34,858 INFO L226 Difference]: Without dead ends: 9710 [2019-12-28 01:55:34,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:34,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9710 states. [2019-12-28 01:55:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9710 to 8883. [2019-12-28 01:55:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2019-12-28 01:55:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 26592 transitions. [2019-12-28 01:55:35,098 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 26592 transitions. Word has length 65 [2019-12-28 01:55:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:35,098 INFO L462 AbstractCegarLoop]: Abstraction has 8883 states and 26592 transitions. [2019-12-28 01:55:35,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 26592 transitions. [2019-12-28 01:55:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:55:35,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:35,103 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-28 01:55:35,103 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:35,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:35,103 INFO L82 PathProgramCache]: Analyzing trace with hash 450731263, now seen corresponding path program 1 times [2019-12-28 01:55:35,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:35,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276298579] [2019-12-28 01:55:35,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:35,191 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-28 01:55:35,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276298579] [2019-12-28 01:55:35,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:35,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:35,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701358597] [2019-12-28 01:55:35,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:35,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:35,210 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 65 transitions. [2019-12-28 01:55:35,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:35,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:35,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:35,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:35,212 INFO L87 Difference]: Start difference. First operand 8883 states and 26592 transitions. Second operand 6 states. [2019-12-28 01:55:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:35,634 INFO L93 Difference]: Finished difference Result 11199 states and 33079 transitions. [2019-12-28 01:55:35,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 01:55:35,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-28 01:55:35,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:35,649 INFO L225 Difference]: With dead ends: 11199 [2019-12-28 01:55:35,650 INFO L226 Difference]: Without dead ends: 11138 [2019-12-28 01:55:35,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:55:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-28 01:55:35,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10414. [2019-12-28 01:55:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-28 01:55:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 30946 transitions. [2019-12-28 01:55:35,782 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 30946 transitions. Word has length 65 [2019-12-28 01:55:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:35,782 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 30946 transitions. [2019-12-28 01:55:35,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 30946 transitions. [2019-12-28 01:55:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:35,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:35,788 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] [2019-12-28 01:55:35,788 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1715256149, now seen corresponding path program 1 times [2019-12-28 01:55:35,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:35,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233928964] [2019-12-28 01:55:35,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:35,848 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-28 01:55:35,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233928964] [2019-12-28 01:55:35,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:35,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:35,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280901728] [2019-12-28 01:55:35,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:35,861 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:35,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:55:35,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:35,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 01:55:35,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:55:35,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:55:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:35,944 INFO L87 Difference]: Start difference. First operand 10414 states and 30946 transitions. Second operand 7 states. [2019-12-28 01:55:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:36,274 INFO L93 Difference]: Finished difference Result 13387 states and 39337 transitions. [2019-12-28 01:55:36,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:55:36,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-28 01:55:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:36,298 INFO L225 Difference]: With dead ends: 13387 [2019-12-28 01:55:36,298 INFO L226 Difference]: Without dead ends: 13387 [2019-12-28 01:55:36,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13387 states. [2019-12-28 01:55:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13387 to 11728. [2019-12-28 01:55:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11728 states. [2019-12-28 01:55:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11728 states to 11728 states and 34581 transitions. [2019-12-28 01:55:36,550 INFO L78 Accepts]: Start accepts. Automaton has 11728 states and 34581 transitions. Word has length 71 [2019-12-28 01:55:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:36,550 INFO L462 AbstractCegarLoop]: Abstraction has 11728 states and 34581 transitions. [2019-12-28 01:55:36,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:55:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 11728 states and 34581 transitions. [2019-12-28 01:55:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:36,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:36,562 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] [2019-12-28 01:55:36,562 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash -470491668, now seen corresponding path program 1 times [2019-12-28 01:55:36,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:36,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949600141] [2019-12-28 01:55:36,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:36,748 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-28 01:55:36,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949600141] [2019-12-28 01:55:36,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:36,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:36,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2036028644] [2019-12-28 01:55:36,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:36,762 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:36,787 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:55:36,787 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:36,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-28 01:55:36,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:55:36,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:55:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:55:36,946 INFO L87 Difference]: Start difference. First operand 11728 states and 34581 transitions. Second operand 10 states. [2019-12-28 01:55:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:37,818 INFO L93 Difference]: Finished difference Result 12877 states and 37338 transitions. [2019-12-28 01:55:37,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:37,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-12-28 01:55:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:37,836 INFO L225 Difference]: With dead ends: 12877 [2019-12-28 01:55:37,836 INFO L226 Difference]: Without dead ends: 12877 [2019-12-28 01:55:37,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:55:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-28 01:55:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 12577. [2019-12-28 01:55:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12577 states. [2019-12-28 01:55:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12577 states to 12577 states and 36580 transitions. [2019-12-28 01:55:37,992 INFO L78 Accepts]: Start accepts. Automaton has 12577 states and 36580 transitions. Word has length 71 [2019-12-28 01:55:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:37,992 INFO L462 AbstractCegarLoop]: Abstraction has 12577 states and 36580 transitions. [2019-12-28 01:55:37,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:55:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 12577 states and 36580 transitions. [2019-12-28 01:55:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:38,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:38,003 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] [2019-12-28 01:55:38,003 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:38,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:38,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1747266285, now seen corresponding path program 1 times [2019-12-28 01:55:38,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:38,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258532863] [2019-12-28 01:55:38,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:38,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-28 01:55:38,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258532863] [2019-12-28 01:55:38,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:38,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:38,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1342120010] [2019-12-28 01:55:38,086 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:38,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:38,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:55:38,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:38,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 01:55:38,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:55:38,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:38,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:55:38,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:55:38,285 INFO L87 Difference]: Start difference. First operand 12577 states and 36580 transitions. Second operand 10 states. [2019-12-28 01:55:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:39,052 INFO L93 Difference]: Finished difference Result 14466 states and 40828 transitions. [2019-12-28 01:55:39,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:55:39,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-12-28 01:55:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:39,072 INFO L225 Difference]: With dead ends: 14466 [2019-12-28 01:55:39,072 INFO L226 Difference]: Without dead ends: 14466 [2019-12-28 01:55:39,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:55:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2019-12-28 01:55:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 13140. [2019-12-28 01:55:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13140 states. [2019-12-28 01:55:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13140 states to 13140 states and 37549 transitions. [2019-12-28 01:55:39,244 INFO L78 Accepts]: Start accepts. Automaton has 13140 states and 37549 transitions. Word has length 71 [2019-12-28 01:55:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:39,244 INFO L462 AbstractCegarLoop]: Abstraction has 13140 states and 37549 transitions. [2019-12-28 01:55:39,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:55:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 13140 states and 37549 transitions. [2019-12-28 01:55:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:39,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:39,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:39,253 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:39,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1958617198, now seen corresponding path program 1 times [2019-12-28 01:55:39,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:39,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810613069] [2019-12-28 01:55:39,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:39,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810613069] [2019-12-28 01:55:39,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:39,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:39,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1853028149] [2019-12-28 01:55:39,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:39,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:39,360 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:55:39,361 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:39,396 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 01:55:39,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:55:39,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:55:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:39,398 INFO L87 Difference]: Start difference. First operand 13140 states and 37549 transitions. Second operand 7 states. [2019-12-28 01:55:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:39,898 INFO L93 Difference]: Finished difference Result 16966 states and 48261 transitions. [2019-12-28 01:55:39,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:55:39,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-28 01:55:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:39,922 INFO L225 Difference]: With dead ends: 16966 [2019-12-28 01:55:39,922 INFO L226 Difference]: Without dead ends: 16966 [2019-12-28 01:55:39,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16966 states. [2019-12-28 01:55:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16966 to 15670. [2019-12-28 01:55:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15670 states. [2019-12-28 01:55:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15670 states to 15670 states and 44446 transitions. [2019-12-28 01:55:40,130 INFO L78 Accepts]: Start accepts. Automaton has 15670 states and 44446 transitions. Word has length 71 [2019-12-28 01:55:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:40,130 INFO L462 AbstractCegarLoop]: Abstraction has 15670 states and 44446 transitions. [2019-12-28 01:55:40,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:55:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 15670 states and 44446 transitions. [2019-12-28 01:55:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:40,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:40,139 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] [2019-12-28 01:55:40,139 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:40,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:40,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1448083021, now seen corresponding path program 1 times [2019-12-28 01:55:40,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:40,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472121005] [2019-12-28 01:55:40,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:40,242 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-28 01:55:40,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472121005] [2019-12-28 01:55:40,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:40,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:40,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276564896] [2019-12-28 01:55:40,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:40,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:40,280 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:55:40,281 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:40,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:40,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:40,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:40,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:40,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:40,283 INFO L87 Difference]: Start difference. First operand 15670 states and 44446 transitions. Second operand 6 states. [2019-12-28 01:55:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:40,444 INFO L93 Difference]: Finished difference Result 16084 states and 44227 transitions. [2019-12-28 01:55:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:40,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:55:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:40,464 INFO L225 Difference]: With dead ends: 16084 [2019-12-28 01:55:40,464 INFO L226 Difference]: Without dead ends: 16084 [2019-12-28 01:55:40,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2019-12-28 01:55:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 14714. [2019-12-28 01:55:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14714 states. [2019-12-28 01:55:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14714 states to 14714 states and 40522 transitions. [2019-12-28 01:55:40,644 INFO L78 Accepts]: Start accepts. Automaton has 14714 states and 40522 transitions. Word has length 71 [2019-12-28 01:55:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:40,644 INFO L462 AbstractCegarLoop]: Abstraction has 14714 states and 40522 transitions. [2019-12-28 01:55:40,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 14714 states and 40522 transitions. [2019-12-28 01:55:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:40,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:40,651 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] [2019-12-28 01:55:40,651 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:40,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:40,651 INFO L82 PathProgramCache]: Analyzing trace with hash 538635343, now seen corresponding path program 1 times [2019-12-28 01:55:40,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:40,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101347528] [2019-12-28 01:55:40,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:40,729 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-28 01:55:40,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101347528] [2019-12-28 01:55:40,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:40,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:40,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1328535495] [2019-12-28 01:55:40,731 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:40,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:40,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:55:40,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:40,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:55:40,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:40,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:40,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:40,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:40,783 INFO L87 Difference]: Start difference. First operand 14714 states and 40522 transitions. Second operand 6 states. [2019-12-28 01:55:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:40,836 INFO L93 Difference]: Finished difference Result 5315 states and 12566 transitions. [2019-12-28 01:55:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:55:40,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:55:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:40,842 INFO L225 Difference]: With dead ends: 5315 [2019-12-28 01:55:40,843 INFO L226 Difference]: Without dead ends: 4643 [2019-12-28 01:55:40,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2019-12-28 01:55:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 4541. [2019-12-28 01:55:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-12-28 01:55:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 10384 transitions. [2019-12-28 01:55:40,886 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 10384 transitions. Word has length 71 [2019-12-28 01:55:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:40,887 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 10384 transitions. [2019-12-28 01:55:40,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 10384 transitions. [2019-12-28 01:55:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:40,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:40,891 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] [2019-12-28 01:55:40,891 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1679970640, now seen corresponding path program 1 times [2019-12-28 01:55:40,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:40,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72207851] [2019-12-28 01:55:40,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:40,930 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-28 01:55:40,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72207851] [2019-12-28 01:55:40,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:40,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:55:40,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [191053785] [2019-12-28 01:55:40,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:40,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:40,958 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:40,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:40,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:40,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:55:40,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:55:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:40,960 INFO L87 Difference]: Start difference. First operand 4541 states and 10384 transitions. Second operand 3 states. [2019-12-28 01:55:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:41,010 INFO L93 Difference]: Finished difference Result 5482 states and 12309 transitions. [2019-12-28 01:55:41,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:55:41,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-28 01:55:41,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:41,019 INFO L225 Difference]: With dead ends: 5482 [2019-12-28 01:55:41,019 INFO L226 Difference]: Without dead ends: 5482 [2019-12-28 01:55:41,020 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-28 01:55:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2019-12-28 01:55:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 4476. [2019-12-28 01:55:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4476 states. [2019-12-28 01:55:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 9946 transitions. [2019-12-28 01:55:41,105 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 9946 transitions. Word has length 71 [2019-12-28 01:55:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:41,106 INFO L462 AbstractCegarLoop]: Abstraction has 4476 states and 9946 transitions. [2019-12-28 01:55:41,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:55:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 9946 transitions. [2019-12-28 01:55:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 01:55:41,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:41,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] [2019-12-28 01:55:41,114 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1543631293, now seen corresponding path program 1 times [2019-12-28 01:55:41,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:41,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094704928] [2019-12-28 01:55:41,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:41,191 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-28 01:55:41,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094704928] [2019-12-28 01:55:41,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:41,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:41,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1104209199] [2019-12-28 01:55:41,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:41,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:41,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 77 transitions. [2019-12-28 01:55:41,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:41,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:41,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:41,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:41,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:41,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:41,231 INFO L87 Difference]: Start difference. First operand 4476 states and 9946 transitions. Second operand 5 states. [2019-12-28 01:55:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:41,443 INFO L93 Difference]: Finished difference Result 5533 states and 12363 transitions. [2019-12-28 01:55:41,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:55:41,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-28 01:55:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:41,451 INFO L225 Difference]: With dead ends: 5533 [2019-12-28 01:55:41,451 INFO L226 Difference]: Without dead ends: 5533 [2019-12-28 01:55:41,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2019-12-28 01:55:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 4896. [2019-12-28 01:55:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4896 states. [2019-12-28 01:55:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10904 transitions. [2019-12-28 01:55:41,501 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10904 transitions. Word has length 77 [2019-12-28 01:55:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:41,502 INFO L462 AbstractCegarLoop]: Abstraction has 4896 states and 10904 transitions. [2019-12-28 01:55:41,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10904 transitions. [2019-12-28 01:55:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 01:55:41,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:41,506 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-28 01:55:41,506 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:41,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:41,507 INFO L82 PathProgramCache]: Analyzing trace with hash 199179042, now seen corresponding path program 1 times [2019-12-28 01:55:41,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:41,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327340164] [2019-12-28 01:55:41,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:41,582 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-28 01:55:41,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327340164] [2019-12-28 01:55:41,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:41,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:55:41,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797244625] [2019-12-28 01:55:41,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:41,598 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:41,622 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 77 transitions. [2019-12-28 01:55:41,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:41,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:41,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:55:41,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:55:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:41,624 INFO L87 Difference]: Start difference. First operand 4896 states and 10904 transitions. Second operand 7 states. [2019-12-28 01:55:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:42,085 INFO L93 Difference]: Finished difference Result 5669 states and 12508 transitions. [2019-12-28 01:55:42,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:55:42,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-28 01:55:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:42,093 INFO L225 Difference]: With dead ends: 5669 [2019-12-28 01:55:42,093 INFO L226 Difference]: Without dead ends: 5616 [2019-12-28 01:55:42,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 01:55:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2019-12-28 01:55:42,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 4983. [2019-12-28 01:55:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2019-12-28 01:55:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 10993 transitions. [2019-12-28 01:55:42,144 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 10993 transitions. Word has length 77 [2019-12-28 01:55:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:42,144 INFO L462 AbstractCegarLoop]: Abstraction has 4983 states and 10993 transitions. [2019-12-28 01:55:42,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:55:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 10993 transitions. [2019-12-28 01:55:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 01:55:42,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:42,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:42,149 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:42,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash -283880815, now seen corresponding path program 1 times [2019-12-28 01:55:42,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:42,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367246684] [2019-12-28 01:55:42,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:42,217 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-28 01:55:42,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367246684] [2019-12-28 01:55:42,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:42,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:42,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1502144513] [2019-12-28 01:55:42,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:42,241 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:42,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 232 transitions. [2019-12-28 01:55:42,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:42,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 01:55:42,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:55:42,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:42,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:55:42,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:42,392 INFO L87 Difference]: Start difference. First operand 4983 states and 10993 transitions. Second operand 7 states. [2019-12-28 01:55:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:43,693 INFO L93 Difference]: Finished difference Result 8168 states and 18092 transitions. [2019-12-28 01:55:43,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 01:55:43,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-28 01:55:43,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:43,703 INFO L225 Difference]: With dead ends: 8168 [2019-12-28 01:55:43,703 INFO L226 Difference]: Without dead ends: 8168 [2019-12-28 01:55:43,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-28 01:55:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8168 states. [2019-12-28 01:55:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8168 to 5105. [2019-12-28 01:55:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2019-12-28 01:55:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 11259 transitions. [2019-12-28 01:55:43,769 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 11259 transitions. Word has length 98 [2019-12-28 01:55:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:43,769 INFO L462 AbstractCegarLoop]: Abstraction has 5105 states and 11259 transitions. [2019-12-28 01:55:43,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:55:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 11259 transitions. [2019-12-28 01:55:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 01:55:43,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:43,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:55:43,774 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1087998493, now seen corresponding path program 2 times [2019-12-28 01:55:43,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:43,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514944869] [2019-12-28 01:55:43,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:43,910 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-28 01:55:43,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514944869] [2019-12-28 01:55:43,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:43,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:55:43,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064628668] [2019-12-28 01:55:43,913 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:43,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:44,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 227 transitions. [2019-12-28 01:55:44,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:44,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:55:44,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:55:44,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:55:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:55:44,128 INFO L87 Difference]: Start difference. First operand 5105 states and 11259 transitions. Second operand 10 states. [2019-12-28 01:55:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:48,179 INFO L93 Difference]: Finished difference Result 12301 states and 26537 transitions. [2019-12-28 01:55:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-28 01:55:48,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-28 01:55:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:48,195 INFO L225 Difference]: With dead ends: 12301 [2019-12-28 01:55:48,195 INFO L226 Difference]: Without dead ends: 12242 [2019-12-28 01:55:48,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=765, Unknown=0, NotChecked=0, Total=992 [2019-12-28 01:55:48,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12242 states. [2019-12-28 01:55:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12242 to 7682. [2019-12-28 01:55:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7682 states. [2019-12-28 01:55:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7682 states to 7682 states and 16737 transitions. [2019-12-28 01:55:48,296 INFO L78 Accepts]: Start accepts. Automaton has 7682 states and 16737 transitions. Word has length 98 [2019-12-28 01:55:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:48,296 INFO L462 AbstractCegarLoop]: Abstraction has 7682 states and 16737 transitions. [2019-12-28 01:55:48,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:55:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 7682 states and 16737 transitions. [2019-12-28 01:55:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 01:55:48,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:48,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:48,305 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018300, now seen corresponding path program 1 times [2019-12-28 01:55:48,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:48,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493979610] [2019-12-28 01:55:48,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:48,406 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-28 01:55:48,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493979610] [2019-12-28 01:55:48,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:48,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:55:48,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1294973315] [2019-12-28 01:55:48,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:48,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:48,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 227 transitions. [2019-12-28 01:55:48,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:48,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-28 01:55:48,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 01:55:48,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 01:55:48,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:55:48,699 INFO L87 Difference]: Start difference. First operand 7682 states and 16737 transitions. Second operand 13 states. [2019-12-28 01:55:48,918 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-12-28 01:55:55,647 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-12-28 01:55:57,084 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-28 01:55:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:58,309 INFO L93 Difference]: Finished difference Result 28977 states and 62633 transitions. [2019-12-28 01:55:58,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-28 01:55:58,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2019-12-28 01:55:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:58,337 INFO L225 Difference]: With dead ends: 28977 [2019-12-28 01:55:58,337 INFO L226 Difference]: Without dead ends: 28977 [2019-12-28 01:55:58,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3773 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1707, Invalid=8595, Unknown=0, NotChecked=0, Total=10302 [2019-12-28 01:55:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28977 states. [2019-12-28 01:55:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28977 to 8484. [2019-12-28 01:55:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8484 states. [2019-12-28 01:55:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 18511 transitions. [2019-12-28 01:55:58,535 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 18511 transitions. Word has length 98 [2019-12-28 01:55:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:58,535 INFO L462 AbstractCegarLoop]: Abstraction has 8484 states and 18511 transitions. [2019-12-28 01:55:58,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 01:55:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 18511 transitions. [2019-12-28 01:55:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 01:55:58,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:58,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:58,545 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:58,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash -919037989, now seen corresponding path program 1 times [2019-12-28 01:55:58,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:58,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800406274] [2019-12-28 01:55:58,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:58,611 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-28 01:55:58,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800406274] [2019-12-28 01:55:58,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:58,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:58,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779840024] [2019-12-28 01:55:58,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:58,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:58,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 227 transitions. [2019-12-28 01:55:58,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:58,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 01:55:58,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:55:58,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:55:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:55:58,840 INFO L87 Difference]: Start difference. First operand 8484 states and 18511 transitions. Second operand 10 states. [2019-12-28 01:55:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:59,739 INFO L93 Difference]: Finished difference Result 11931 states and 25612 transitions. [2019-12-28 01:55:59,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:55:59,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-28 01:55:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:59,753 INFO L225 Difference]: With dead ends: 11931 [2019-12-28 01:55:59,753 INFO L226 Difference]: Without dead ends: 11642 [2019-12-28 01:55:59,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-12-28 01:55:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11642 states. [2019-12-28 01:55:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11642 to 7657. [2019-12-28 01:55:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7657 states. [2019-12-28 01:55:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7657 states to 7657 states and 16728 transitions. [2019-12-28 01:55:59,861 INFO L78 Accepts]: Start accepts. Automaton has 7657 states and 16728 transitions. Word has length 98 [2019-12-28 01:55:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:59,862 INFO L462 AbstractCegarLoop]: Abstraction has 7657 states and 16728 transitions. [2019-12-28 01:55:59,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:55:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 7657 states and 16728 transitions. [2019-12-28 01:55:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:55:59,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:59,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:59,871 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash 663708553, now seen corresponding path program 1 times [2019-12-28 01:55:59,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:59,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183224675] [2019-12-28 01:55:59,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:59,974 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-28 01:55:59,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183224675] [2019-12-28 01:55:59,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:59,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:59,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1414889802] [2019-12-28 01:55:59,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:59,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:00,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 246 transitions. [2019-12-28 01:56:00,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:00,107 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:56:00,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:00,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:00,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:00,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:00,108 INFO L87 Difference]: Start difference. First operand 7657 states and 16728 transitions. Second operand 7 states. [2019-12-28 01:56:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:00,421 INFO L93 Difference]: Finished difference Result 8327 states and 18108 transitions. [2019-12-28 01:56:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:56:00,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-28 01:56:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:00,432 INFO L225 Difference]: With dead ends: 8327 [2019-12-28 01:56:00,432 INFO L226 Difference]: Without dead ends: 8327 [2019-12-28 01:56:00,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-12-28 01:56:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7529. [2019-12-28 01:56:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2019-12-28 01:56:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 16497 transitions. [2019-12-28 01:56:00,552 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 16497 transitions. Word has length 100 [2019-12-28 01:56:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:00,552 INFO L462 AbstractCegarLoop]: Abstraction has 7529 states and 16497 transitions. [2019-12-28 01:56:00,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 16497 transitions. [2019-12-28 01:56:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:00,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:00,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:00,559 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash -582643184, now seen corresponding path program 1 times [2019-12-28 01:56:00,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:00,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743846044] [2019-12-28 01:56:00,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:00,629 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-28 01:56:00,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743846044] [2019-12-28 01:56:00,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:00,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:00,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [743209711] [2019-12-28 01:56:00,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:00,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:00,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 188 transitions. [2019-12-28 01:56:00,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:00,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:00,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:56:00,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:00,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:56:00,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:56:00,755 INFO L87 Difference]: Start difference. First operand 7529 states and 16497 transitions. Second operand 6 states. [2019-12-28 01:56:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:00,870 INFO L93 Difference]: Finished difference Result 8590 states and 18760 transitions. [2019-12-28 01:56:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:00,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-28 01:56:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:00,881 INFO L225 Difference]: With dead ends: 8590 [2019-12-28 01:56:00,881 INFO L226 Difference]: Without dead ends: 8590 [2019-12-28 01:56:00,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8590 states. [2019-12-28 01:56:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8590 to 6460. [2019-12-28 01:56:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-28 01:56:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 14157 transitions. [2019-12-28 01:56:00,954 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 14157 transitions. Word has length 100 [2019-12-28 01:56:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:00,954 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 14157 transitions. [2019-12-28 01:56:00,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:56:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 14157 transitions. [2019-12-28 01:56:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:00,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:00,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:00,960 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:00,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:00,960 INFO L82 PathProgramCache]: Analyzing trace with hash -231843247, now seen corresponding path program 1 times [2019-12-28 01:56:00,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:00,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886748973] [2019-12-28 01:56:00,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:01,075 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-28 01:56:01,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886748973] [2019-12-28 01:56:01,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:01,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:56:01,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065858709] [2019-12-28 01:56:01,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:01,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:01,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 188 transitions. [2019-12-28 01:56:01,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:01,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:01,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:01,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:01,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:01,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:01,206 INFO L87 Difference]: Start difference. First operand 6460 states and 14157 transitions. Second operand 7 states. [2019-12-28 01:56:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:01,472 INFO L93 Difference]: Finished difference Result 7828 states and 17101 transitions. [2019-12-28 01:56:01,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:56:01,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-28 01:56:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:01,480 INFO L225 Difference]: With dead ends: 7828 [2019-12-28 01:56:01,481 INFO L226 Difference]: Without dead ends: 7824 [2019-12-28 01:56:01,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:56:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2019-12-28 01:56:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 6809. [2019-12-28 01:56:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6809 states. [2019-12-28 01:56:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6809 states to 6809 states and 14999 transitions. [2019-12-28 01:56:01,553 INFO L78 Accepts]: Start accepts. Automaton has 6809 states and 14999 transitions. Word has length 100 [2019-12-28 01:56:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:01,553 INFO L462 AbstractCegarLoop]: Abstraction has 6809 states and 14999 transitions. [2019-12-28 01:56:01,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6809 states and 14999 transitions. [2019-12-28 01:56:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:01,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:01,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:01,559 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash -200823440, now seen corresponding path program 1 times [2019-12-28 01:56:01,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:01,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269468654] [2019-12-28 01:56:01,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:01,710 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-28 01:56:01,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269468654] [2019-12-28 01:56:01,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:01,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 01:56:01,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1872743837] [2019-12-28 01:56:01,711 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:01,733 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:01,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 188 transitions. [2019-12-28 01:56:01,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:01,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:56:01,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 01:56:01,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 01:56:01,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:56:01,921 INFO L87 Difference]: Start difference. First operand 6809 states and 14999 transitions. Second operand 13 states. [2019-12-28 01:56:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:05,051 INFO L93 Difference]: Finished difference Result 9810 states and 21399 transitions. [2019-12-28 01:56:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-28 01:56:05,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2019-12-28 01:56:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:05,063 INFO L225 Difference]: With dead ends: 9810 [2019-12-28 01:56:05,063 INFO L226 Difference]: Without dead ends: 9810 [2019-12-28 01:56:05,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=371, Invalid=1521, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 01:56:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9810 states. [2019-12-28 01:56:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9810 to 7054. [2019-12-28 01:56:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7054 states. [2019-12-28 01:56:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 15505 transitions. [2019-12-28 01:56:05,190 INFO L78 Accepts]: Start accepts. Automaton has 7054 states and 15505 transitions. Word has length 100 [2019-12-28 01:56:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:05,190 INFO L462 AbstractCegarLoop]: Abstraction has 7054 states and 15505 transitions. [2019-12-28 01:56:05,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 01:56:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 7054 states and 15505 transitions. [2019-12-28 01:56:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:05,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:05,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:05,197 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2056087567, now seen corresponding path program 1 times [2019-12-28 01:56:05,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:05,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572955705] [2019-12-28 01:56:05,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:05,344 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-28 01:56:05,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572955705] [2019-12-28 01:56:05,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:05,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 01:56:05,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [705425279] [2019-12-28 01:56:05,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:05,363 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:05,453 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 188 transitions. [2019-12-28 01:56:05,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:05,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:05,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 01:56:05,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 01:56:05,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:56:05,501 INFO L87 Difference]: Start difference. First operand 7054 states and 15505 transitions. Second operand 12 states. [2019-12-28 01:56:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:06,227 INFO L93 Difference]: Finished difference Result 21768 states and 48452 transitions. [2019-12-28 01:56:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 01:56:06,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-12-28 01:56:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:06,250 INFO L225 Difference]: With dead ends: 21768 [2019-12-28 01:56:06,250 INFO L226 Difference]: Without dead ends: 14312 [2019-12-28 01:56:06,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-28 01:56:06,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14312 states. [2019-12-28 01:56:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14312 to 7081. [2019-12-28 01:56:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7081 states. [2019-12-28 01:56:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 15476 transitions. [2019-12-28 01:56:06,379 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 15476 transitions. Word has length 100 [2019-12-28 01:56:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:06,380 INFO L462 AbstractCegarLoop]: Abstraction has 7081 states and 15476 transitions. [2019-12-28 01:56:06,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 01:56:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 15476 transitions. [2019-12-28 01:56:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:06,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:06,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:06,386 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash -446759572, now seen corresponding path program 1 times [2019-12-28 01:56:06,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:06,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352734222] [2019-12-28 01:56:06,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:06,504 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-28 01:56:06,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352734222] [2019-12-28 01:56:06,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:06,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:06,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799515725] [2019-12-28 01:56:06,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:06,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:06,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 209 transitions. [2019-12-28 01:56:06,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:06,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:06,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:06,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:06,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:06,624 INFO L87 Difference]: Start difference. First operand 7081 states and 15476 transitions. Second operand 7 states. [2019-12-28 01:56:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:06,881 INFO L93 Difference]: Finished difference Result 8625 states and 18532 transitions. [2019-12-28 01:56:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:06,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-28 01:56:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:06,891 INFO L225 Difference]: With dead ends: 8625 [2019-12-28 01:56:06,892 INFO L226 Difference]: Without dead ends: 8595 [2019-12-28 01:56:06,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8595 states. [2019-12-28 01:56:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8595 to 7052. [2019-12-28 01:56:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7052 states. [2019-12-28 01:56:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7052 states to 7052 states and 15359 transitions. [2019-12-28 01:56:06,967 INFO L78 Accepts]: Start accepts. Automaton has 7052 states and 15359 transitions. Word has length 100 [2019-12-28 01:56:06,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:06,967 INFO L462 AbstractCegarLoop]: Abstraction has 7052 states and 15359 transitions. [2019-12-28 01:56:06,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 7052 states and 15359 transitions. [2019-12-28 01:56:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:06,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:06,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:06,974 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2115604191, now seen corresponding path program 1 times [2019-12-28 01:56:06,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:06,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28997373] [2019-12-28 01:56:06,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:07,036 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-28 01:56:07,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28997373] [2019-12-28 01:56:07,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:07,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:07,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1594833443] [2019-12-28 01:56:07,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:07,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:07,168 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 207 transitions. [2019-12-28 01:56:07,168 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:07,169 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:07,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:56:07,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:07,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:56:07,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:56:07,171 INFO L87 Difference]: Start difference. First operand 7052 states and 15359 transitions. Second operand 5 states. [2019-12-28 01:56:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:07,469 INFO L93 Difference]: Finished difference Result 8260 states and 17870 transitions. [2019-12-28 01:56:07,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:07,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-28 01:56:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:07,481 INFO L225 Difference]: With dead ends: 8260 [2019-12-28 01:56:07,481 INFO L226 Difference]: Without dead ends: 8189 [2019-12-28 01:56:07,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:07,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8189 states. [2019-12-28 01:56:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8189 to 6872. [2019-12-28 01:56:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6872 states. [2019-12-28 01:56:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 15021 transitions. [2019-12-28 01:56:07,599 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 15021 transitions. Word has length 100 [2019-12-28 01:56:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:07,600 INFO L462 AbstractCegarLoop]: Abstraction has 6872 states and 15021 transitions. [2019-12-28 01:56:07,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:56:07,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 15021 transitions. [2019-12-28 01:56:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:07,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:07,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:07,609 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash 795255459, now seen corresponding path program 2 times [2019-12-28 01:56:07,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:07,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384932882] [2019-12-28 01:56:07,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:07,804 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-28 01:56:07,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384932882] [2019-12-28 01:56:07,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:07,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 01:56:07,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1444628928] [2019-12-28 01:56:07,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:07,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:07,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 207 transitions. [2019-12-28 01:56:07,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:08,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:08,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:56:08,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:08,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:56:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:56:08,004 INFO L87 Difference]: Start difference. First operand 6872 states and 15021 transitions. Second operand 11 states. [2019-12-28 01:56:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:09,669 INFO L93 Difference]: Finished difference Result 8167 states and 17759 transitions. [2019-12-28 01:56:09,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 01:56:09,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-12-28 01:56:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:09,679 INFO L225 Difference]: With dead ends: 8167 [2019-12-28 01:56:09,679 INFO L226 Difference]: Without dead ends: 8147 [2019-12-28 01:56:09,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2019-12-28 01:56:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8147 states. [2019-12-28 01:56:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8147 to 6970. [2019-12-28 01:56:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6970 states. [2019-12-28 01:56:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6970 states to 6970 states and 15247 transitions. [2019-12-28 01:56:09,754 INFO L78 Accepts]: Start accepts. Automaton has 6970 states and 15247 transitions. Word has length 100 [2019-12-28 01:56:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:09,754 INFO L462 AbstractCegarLoop]: Abstraction has 6970 states and 15247 transitions. [2019-12-28 01:56:09,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:56:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6970 states and 15247 transitions. [2019-12-28 01:56:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:09,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:09,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:09,763 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:09,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:09,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1242800830, now seen corresponding path program 1 times [2019-12-28 01:56:09,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:09,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567049976] [2019-12-28 01:56:09,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:09,832 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-28 01:56:09,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567049976] [2019-12-28 01:56:09,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:09,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:09,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039417078] [2019-12-28 01:56:09,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:09,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:09,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 207 transitions. [2019-12-28 01:56:09,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:09,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:09,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:09,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:09,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:09,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:09,945 INFO L87 Difference]: Start difference. First operand 6970 states and 15247 transitions. Second operand 7 states. [2019-12-28 01:56:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:10,130 INFO L93 Difference]: Finished difference Result 8141 states and 17546 transitions. [2019-12-28 01:56:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:56:10,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-28 01:56:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:10,139 INFO L225 Difference]: With dead ends: 8141 [2019-12-28 01:56:10,139 INFO L226 Difference]: Without dead ends: 8141 [2019-12-28 01:56:10,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:56:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8141 states. [2019-12-28 01:56:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8141 to 6880. [2019-12-28 01:56:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6880 states. [2019-12-28 01:56:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6880 states to 6880 states and 15007 transitions. [2019-12-28 01:56:10,212 INFO L78 Accepts]: Start accepts. Automaton has 6880 states and 15007 transitions. Word has length 100 [2019-12-28 01:56:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:10,212 INFO L462 AbstractCegarLoop]: Abstraction has 6880 states and 15007 transitions. [2019-12-28 01:56:10,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 6880 states and 15007 transitions. [2019-12-28 01:56:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:10,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:10,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:56:10,218 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:10,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1369443155, now seen corresponding path program 1 times [2019-12-28 01:56:10,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:10,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083875942] [2019-12-28 01:56:10,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:10,350 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-28 01:56:10,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083875942] [2019-12-28 01:56:10,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:10,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:56:10,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1015931439] [2019-12-28 01:56:10,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:10,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:10,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 209 transitions. [2019-12-28 01:56:10,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:10,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:10,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:56:10,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:10,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:56:10,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:56:10,616 INFO L87 Difference]: Start difference. First operand 6880 states and 15007 transitions. Second operand 10 states. [2019-12-28 01:56:11,380 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-12-28 01:56:11,630 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-12-28 01:56:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:12,543 INFO L93 Difference]: Finished difference Result 9187 states and 19672 transitions. [2019-12-28 01:56:12,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 01:56:12,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-12-28 01:56:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:12,555 INFO L225 Difference]: With dead ends: 9187 [2019-12-28 01:56:12,555 INFO L226 Difference]: Without dead ends: 9187 [2019-12-28 01:56:12,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-12-28 01:56:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9187 states. [2019-12-28 01:56:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9187 to 7039. [2019-12-28 01:56:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7039 states. [2019-12-28 01:56:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7039 states to 7039 states and 15323 transitions. [2019-12-28 01:56:12,644 INFO L78 Accepts]: Start accepts. Automaton has 7039 states and 15323 transitions. Word has length 100 [2019-12-28 01:56:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:12,644 INFO L462 AbstractCegarLoop]: Abstraction has 7039 states and 15323 transitions. [2019-12-28 01:56:12,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:56:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 7039 states and 15323 transitions. [2019-12-28 01:56:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:12,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:12,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:12,651 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:12,651 INFO L82 PathProgramCache]: Analyzing trace with hash 887467852, now seen corresponding path program 1 times [2019-12-28 01:56:12,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:12,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522640414] [2019-12-28 01:56:12,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:12,792 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-28 01:56:12,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522640414] [2019-12-28 01:56:12,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:12,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:56:12,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [486184918] [2019-12-28 01:56:12,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:12,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:12,875 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 209 transitions. [2019-12-28 01:56:12,875 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:12,932 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 01:56:12,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:56:12,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:12,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:56:12,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:56:12,933 INFO L87 Difference]: Start difference. First operand 7039 states and 15323 transitions. Second operand 10 states. [2019-12-28 01:56:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:14,717 INFO L93 Difference]: Finished difference Result 9599 states and 20493 transitions. [2019-12-28 01:56:14,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-28 01:56:14,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-12-28 01:56:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:14,728 INFO L225 Difference]: With dead ends: 9599 [2019-12-28 01:56:14,729 INFO L226 Difference]: Without dead ends: 9599 [2019-12-28 01:56:14,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2019-12-28 01:56:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9599 states. [2019-12-28 01:56:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9599 to 7146. [2019-12-28 01:56:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7146 states. [2019-12-28 01:56:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7146 states to 7146 states and 15537 transitions. [2019-12-28 01:56:14,813 INFO L78 Accepts]: Start accepts. Automaton has 7146 states and 15537 transitions. Word has length 100 [2019-12-28 01:56:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:14,813 INFO L462 AbstractCegarLoop]: Abstraction has 7146 states and 15537 transitions. [2019-12-28 01:56:14,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:56:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 7146 states and 15537 transitions. [2019-12-28 01:56:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:14,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:14,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:14,819 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2002922254, now seen corresponding path program 2 times [2019-12-28 01:56:14,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:14,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37847157] [2019-12-28 01:56:14,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:14,974 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-28 01:56:14,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37847157] [2019-12-28 01:56:14,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:14,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:56:14,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1503145938] [2019-12-28 01:56:14,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:14,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:15,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 225 transitions. [2019-12-28 01:56:15,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:15,135 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 01:56:15,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 01:56:15,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 01:56:15,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:56:15,136 INFO L87 Difference]: Start difference. First operand 7146 states and 15537 transitions. Second operand 12 states. [2019-12-28 01:56:17,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:17,554 INFO L93 Difference]: Finished difference Result 10102 states and 21687 transitions. [2019-12-28 01:56:17,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-28 01:56:17,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-12-28 01:56:17,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:17,567 INFO L225 Difference]: With dead ends: 10102 [2019-12-28 01:56:17,567 INFO L226 Difference]: Without dead ends: 10102 [2019-12-28 01:56:17,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-12-28 01:56:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10102 states. [2019-12-28 01:56:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10102 to 7307. [2019-12-28 01:56:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7307 states. [2019-12-28 01:56:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7307 states to 7307 states and 15901 transitions. [2019-12-28 01:56:17,654 INFO L78 Accepts]: Start accepts. Automaton has 7307 states and 15901 transitions. Word has length 100 [2019-12-28 01:56:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:17,655 INFO L462 AbstractCegarLoop]: Abstraction has 7307 states and 15901 transitions. [2019-12-28 01:56:17,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 01:56:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 15901 transitions. [2019-12-28 01:56:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:17,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:17,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:17,663 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash -35134035, now seen corresponding path program 2 times [2019-12-28 01:56:17,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:17,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581298724] [2019-12-28 01:56:17,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:17,781 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-28 01:56:17,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581298724] [2019-12-28 01:56:17,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:17,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:56:17,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [106283476] [2019-12-28 01:56:17,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:17,794 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:17,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 225 transitions. [2019-12-28 01:56:17,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:17,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-28 01:56:17,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 01:56:17,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:56:17,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:17,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:56:17,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:56:17,916 INFO L87 Difference]: Start difference. First operand 7307 states and 15901 transitions. Second operand 11 states. [2019-12-28 01:56:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:18,148 INFO L93 Difference]: Finished difference Result 12029 states and 26254 transitions. [2019-12-28 01:56:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:56:18,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-12-28 01:56:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:18,155 INFO L225 Difference]: With dead ends: 12029 [2019-12-28 01:56:18,155 INFO L226 Difference]: Without dead ends: 4921 [2019-12-28 01:56:18,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-28 01:56:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2019-12-28 01:56:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 4421. [2019-12-28 01:56:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4421 states. [2019-12-28 01:56:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4421 states to 4421 states and 9664 transitions. [2019-12-28 01:56:18,204 INFO L78 Accepts]: Start accepts. Automaton has 4421 states and 9664 transitions. Word has length 100 [2019-12-28 01:56:18,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:18,204 INFO L462 AbstractCegarLoop]: Abstraction has 4421 states and 9664 transitions. [2019-12-28 01:56:18,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:56:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4421 states and 9664 transitions. [2019-12-28 01:56:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:18,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:18,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:18,208 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:18,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1451347705, now seen corresponding path program 3 times [2019-12-28 01:56:18,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:18,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357281429] [2019-12-28 01:56:18,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:56:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:56:18,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 01:56:18,295 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 01:56:18,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:56:18 BasicIcfg [2019-12-28 01:56:18,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 01:56:18,505 INFO L168 Benchmark]: Toolchain (without parser) took 84801.63 ms. Allocated memory was 137.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 99.6 MB in the beginning and 874.3 MB in the end (delta: -774.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-28 01:56:18,506 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 01:56:18,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.70 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 155.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:18,506 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.99 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:18,507 INFO L168 Benchmark]: Boogie Preprocessor took 77.08 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:18,507 INFO L168 Benchmark]: RCFGBuilder took 1027.83 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 105.0 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:18,507 INFO L168 Benchmark]: TraceAbstraction took 82770.02 ms. Allocated memory was 201.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.0 MB in the beginning and 874.3 MB in the end (delta: -769.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-28 01:56:18,509 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 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.70 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 155.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 102.99 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.08 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1027.83 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 105.0 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82770.02 ms. Allocated memory was 201.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.0 MB in the beginning and 874.3 MB in the end (delta: -769.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L705] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L706] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L707] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L708] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L709] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L710] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L711] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L712] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L713] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L714] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L715] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L716] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L717] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L718] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L813] 0 pthread_t t841; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t841, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L815] 0 pthread_t t842; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L732] 1 a$w_buff1 = a$w_buff0 [L733] 1 a$w_buff0 = 1 [L734] 1 a$w_buff1_used = a$w_buff0_used [L735] 1 a$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t842, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L784] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] EXPR 2 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] 2 a = a$flush_delayed ? a$mem_tmp : a [L788] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L755] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L823] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L826] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L826] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 82.3s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 45.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11682 SDtfs, 19308 SDslu, 34920 SDs, 0 SdLazy, 20680 SolverSat, 1109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 782 GetRequests, 237 SyntacticMatches, 36 SemanticMatches, 509 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5497 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71016occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.0s AutomataMinimizationTime, 38 MinimizatonAttempts, 130892 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3109 NumberOfCodeBlocks, 3109 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2971 ConstructedInterpolants, 0 QuantifiedInterpolants, 729041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...