/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 14:07:31,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 14:07:31,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 14:07:31,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 14:07:31,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 14:07:31,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 14:07:31,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 14:07:31,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 14:07:31,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 14:07:31,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 14:07:31,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 14:07:31,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 14:07:31,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 14:07:31,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 14:07:31,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 14:07:31,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 14:07:31,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 14:07:31,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 14:07:31,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 14:07:31,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 14:07:31,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 14:07:31,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 14:07:31,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 14:07:31,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 14:07:31,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 14:07:31,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 14:07:31,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 14:07:31,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 14:07:31,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 14:07:31,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 14:07:31,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 14:07:31,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 14:07:31,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 14:07:31,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 14:07:31,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 14:07:31,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 14:07:31,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 14:07:31,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 14:07:31,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 14:07:31,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 14:07:31,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 14:07:31,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 14:07:31,495 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 14:07:31,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 14:07:31,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 14:07:31,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 14:07:31,499 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 14:07:31,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 14:07:31,499 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 14:07:31,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 14:07:31,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 14:07:31,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 14:07:31,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 14:07:31,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 14:07:31,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 14:07:31,501 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 14:07:31,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 14:07:31,501 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 14:07:31,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 14:07:31,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 14:07:31,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 14:07:31,503 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 14:07:31,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 14:07:31,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 14:07:31,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 14:07:31,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 14:07:31,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 14:07:31,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 14:07:31,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 14:07:31,505 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 14:07:31,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 14:07:31,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 14:07:31,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 14:07:31,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 14:07:31,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 14:07:31,794 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 14:07:31,794 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 14:07:31,796 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-27 14:07:31,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1922efa/d7a3141059e940549f656ec38e5124cf/FLAG7dbc6f343 [2019-12-27 14:07:32,443 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 14:07:32,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-27 14:07:32,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1922efa/d7a3141059e940549f656ec38e5124cf/FLAG7dbc6f343 [2019-12-27 14:07:32,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1922efa/d7a3141059e940549f656ec38e5124cf [2019-12-27 14:07:32,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 14:07:32,710 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 14:07:32,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 14:07:32,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 14:07:32,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 14:07:32,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:07:32" (1/1) ... [2019-12-27 14:07:32,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:32, skipping insertion in model container [2019-12-27 14:07:32,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:07:32" (1/1) ... [2019-12-27 14:07:32,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 14:07:32,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 14:07:33,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:07:33,335 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 14:07:33,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:07:33,472 INFO L208 MainTranslator]: Completed translation [2019-12-27 14:07:33,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33 WrapperNode [2019-12-27 14:07:33,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 14:07:33,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 14:07:33,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 14:07:33,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 14:07:33,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... [2019-12-27 14:07:33,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... [2019-12-27 14:07:33,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 14:07:33,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 14:07:33,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 14:07:33,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 14:07:33,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... [2019-12-27 14:07:33,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... [2019-12-27 14:07:33,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... [2019-12-27 14:07:33,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... [2019-12-27 14:07:33,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... [2019-12-27 14:07:33,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... [2019-12-27 14:07:33,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... [2019-12-27 14:07:33,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 14:07:33,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 14:07:33,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 14:07:33,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 14:07:33,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 14:07:33,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 14:07:33,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 14:07:33,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 14:07:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 14:07:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 14:07:33,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 14:07:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 14:07:33,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 14:07:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 14:07:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 14:07:33,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 14:07:33,651 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 14:07:34,356 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 14:07:34,356 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 14:07:34,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:07:34 BoogieIcfgContainer [2019-12-27 14:07:34,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 14:07:34,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 14:07:34,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 14:07:34,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 14:07:34,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:07:32" (1/3) ... [2019-12-27 14:07:34,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e17654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:07:34, skipping insertion in model container [2019-12-27 14:07:34,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:33" (2/3) ... [2019-12-27 14:07:34,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e17654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:07:34, skipping insertion in model container [2019-12-27 14:07:34,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:07:34" (3/3) ... [2019-12-27 14:07:34,367 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.opt.i [2019-12-27 14:07:34,378 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 14:07:34,378 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 14:07:34,397 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 14:07:34,398 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 14:07:34,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,456 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,457 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,466 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,517 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,518 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,518 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,524 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:07:34,543 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 14:07:34,564 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 14:07:34,565 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 14:07:34,565 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 14:07:34,565 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 14:07:34,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 14:07:34,565 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 14:07:34,565 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 14:07:34,566 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 14:07:34,580 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-27 14:07:36,643 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-27 14:07:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-27 14:07:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 14:07:36,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:07:36,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:07:36,654 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:07:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:07:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash -211488886, now seen corresponding path program 1 times [2019-12-27 14:07:36,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:07:36,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702712496] [2019-12-27 14:07:36,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:07:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:07:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:07:37,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702712496] [2019-12-27 14:07:37,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:07:37,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:07:37,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18770401] [2019-12-27 14:07:37,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:07:37,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:07:37,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:07:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:07:37,039 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-27 14:07:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:07:38,781 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-27 14:07:38,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:07:38,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-27 14:07:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:07:39,106 INFO L225 Difference]: With dead ends: 33591 [2019-12-27 14:07:39,107 INFO L226 Difference]: Without dead ends: 25703 [2019-12-27 14:07:39,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:07:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-27 14:07:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-27 14:07:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-27 14:07:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-27 14:07:40,530 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-27 14:07:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:07:40,531 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-27 14:07:40,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:07:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-27 14:07:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 14:07:40,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:07:40,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:07:40,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:07:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:07:40,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1616921250, now seen corresponding path program 1 times [2019-12-27 14:07:40,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:07:40,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484630153] [2019-12-27 14:07:40,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:07:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:07:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:07:40,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484630153] [2019-12-27 14:07:40,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:07:40,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:07:40,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027033677] [2019-12-27 14:07:40,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:07:40,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:07:40,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:07:40,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:07:40,706 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-27 14:07:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:07:42,058 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-27 14:07:42,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:07:42,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-27 14:07:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:07:42,245 INFO L225 Difference]: With dead ends: 41081 [2019-12-27 14:07:42,246 INFO L226 Difference]: Without dead ends: 40545 [2019-12-27 14:07:42,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:07:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-27 14:07:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-27 14:07:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-27 14:07:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-27 14:07:44,950 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-27 14:07:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:07:44,951 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-27 14:07:44,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:07:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-27 14:07:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 14:07:44,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:07:44,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:07:44,958 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:07:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:07:44,959 INFO L82 PathProgramCache]: Analyzing trace with hash -7572596, now seen corresponding path program 1 times [2019-12-27 14:07:44,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:07:44,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825101096] [2019-12-27 14:07:44,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:07:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:07:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:07:45,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825101096] [2019-12-27 14:07:45,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:07:45,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:07:45,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190926993] [2019-12-27 14:07:45,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:07:45,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:07:45,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:07:45,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:07:45,084 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-27 14:07:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:07:47,152 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-27 14:07:47,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:07:47,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 14:07:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:07:47,370 INFO L225 Difference]: With dead ends: 49778 [2019-12-27 14:07:47,370 INFO L226 Difference]: Without dead ends: 49274 [2019-12-27 14:07:47,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:07:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-27 14:07:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-27 14:07:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-27 14:07:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-27 14:07:48,678 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-27 14:07:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:07:48,678 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-27 14:07:48,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:07:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-27 14:07:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 14:07:48,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:07:48,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:07:48,688 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:07:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:07:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2011067022, now seen corresponding path program 1 times [2019-12-27 14:07:48,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:07:48,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462901559] [2019-12-27 14:07:48,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:07:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:07:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:07:48,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462901559] [2019-12-27 14:07:48,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:07:48,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:07:48,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503034296] [2019-12-27 14:07:48,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:07:48,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:07:48,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:07:48,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:07:48,764 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-27 14:07:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:07:49,136 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-27 14:07:49,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:07:49,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-27 14:07:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:07:49,824 INFO L225 Difference]: With dead ends: 61087 [2019-12-27 14:07:49,824 INFO L226 Difference]: Without dead ends: 61087 [2019-12-27 14:07:49,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:07:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-27 14:07:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-27 14:07:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-27 14:07:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-27 14:07:52,807 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-27 14:07:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:07:52,807 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-27 14:07:52,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:07:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-27 14:07:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 14:07:52,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:07:52,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:07:52,824 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:07:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:07:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1033937592, now seen corresponding path program 1 times [2019-12-27 14:07:52,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:07:52,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135956619] [2019-12-27 14:07:52,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:07:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:07:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:07:52,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135956619] [2019-12-27 14:07:52,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:07:52,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:07:52,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097619850] [2019-12-27 14:07:52,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:07:52,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:07:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:07:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:07:52,964 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-12-27 14:07:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:07:53,938 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-12-27 14:07:53,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:07:53,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 14:07:53,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:07:54,080 INFO L225 Difference]: With dead ends: 63756 [2019-12-27 14:07:54,080 INFO L226 Difference]: Without dead ends: 63756 [2019-12-27 14:07:54,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:07:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-12-27 14:07:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-12-27 14:07:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-27 14:07:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-27 14:07:58,129 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-27 14:07:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:07:58,130 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-27 14:07:58,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:07:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-27 14:07:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 14:07:58,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:07:58,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:07:58,152 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:07:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:07:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1464078345, now seen corresponding path program 1 times [2019-12-27 14:07:58,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:07:58,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685172789] [2019-12-27 14:07:58,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:07:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:07:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:07:58,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685172789] [2019-12-27 14:07:58,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:07:58,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:07:58,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642982844] [2019-12-27 14:07:58,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:07:58,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:07:58,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:07:58,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:07:58,265 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-27 14:07:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:07:59,749 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-27 14:07:59,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 14:07:59,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 14:07:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:07:59,929 INFO L225 Difference]: With dead ends: 83685 [2019-12-27 14:07:59,930 INFO L226 Difference]: Without dead ends: 83685 [2019-12-27 14:07:59,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:08:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-27 14:08:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-27 14:08:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-27 14:08:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-27 14:08:02,431 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-27 14:08:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:02,431 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-27 14:08:02,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:08:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-27 14:08:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 14:08:02,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:02,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:02,449 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:02,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:02,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1943385270, now seen corresponding path program 1 times [2019-12-27 14:08:02,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:02,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761914324] [2019-12-27 14:08:02,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:02,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761914324] [2019-12-27 14:08:02,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:02,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:08:02,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272678056] [2019-12-27 14:08:02,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:08:02,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:08:02,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:08:02,512 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states. [2019-12-27 14:08:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:02,729 INFO L93 Difference]: Finished difference Result 54021 states and 188918 transitions. [2019-12-27 14:08:02,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:08:02,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 14:08:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:02,841 INFO L225 Difference]: With dead ends: 54021 [2019-12-27 14:08:02,841 INFO L226 Difference]: Without dead ends: 54021 [2019-12-27 14:08:02,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:08:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54021 states. [2019-12-27 14:08:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406. [2019-12-27 14:08:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53406 states. [2019-12-27 14:08:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions. [2019-12-27 14:08:06,567 INFO L78 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53 [2019-12-27 14:08:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:06,567 INFO L462 AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions. [2019-12-27 14:08:06,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:08:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions. [2019-12-27 14:08:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 14:08:06,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:06,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:06,577 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:06,577 INFO L82 PathProgramCache]: Analyzing trace with hash -870863555, now seen corresponding path program 1 times [2019-12-27 14:08:06,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:06,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79802909] [2019-12-27 14:08:06,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:06,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79802909] [2019-12-27 14:08:06,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:06,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:08:06,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207626952] [2019-12-27 14:08:06,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:08:06,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:06,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:08:06,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:08:06,650 INFO L87 Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states. [2019-12-27 14:08:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:07,362 INFO L93 Difference]: Finished difference Result 68646 states and 237301 transitions. [2019-12-27 14:08:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 14:08:07,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 14:08:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:07,506 INFO L225 Difference]: With dead ends: 68646 [2019-12-27 14:08:07,506 INFO L226 Difference]: Without dead ends: 68078 [2019-12-27 14:08:07,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 14:08:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68078 states. [2019-12-27 14:08:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490. [2019-12-27 14:08:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53490 states. [2019-12-27 14:08:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions. [2019-12-27 14:08:09,024 INFO L78 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53 [2019-12-27 14:08:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:09,024 INFO L462 AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions. [2019-12-27 14:08:09,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:08:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions. [2019-12-27 14:08:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 14:08:09,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:09,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:09,037 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash 57224143, now seen corresponding path program 1 times [2019-12-27 14:08:09,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:09,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332002203] [2019-12-27 14:08:09,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:09,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332002203] [2019-12-27 14:08:09,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:09,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:08:09,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980069589] [2019-12-27 14:08:09,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:08:09,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:09,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:08:09,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:08:09,191 INFO L87 Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states. [2019-12-27 14:08:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:10,072 INFO L93 Difference]: Finished difference Result 67849 states and 231360 transitions. [2019-12-27 14:08:10,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:08:10,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 14:08:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:10,211 INFO L225 Difference]: With dead ends: 67849 [2019-12-27 14:08:10,211 INFO L226 Difference]: Without dead ends: 67849 [2019-12-27 14:08:10,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:08:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67849 states. [2019-12-27 14:08:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081. [2019-12-27 14:08:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59081 states. [2019-12-27 14:08:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions. [2019-12-27 14:08:11,938 INFO L78 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54 [2019-12-27 14:08:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:11,938 INFO L462 AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions. [2019-12-27 14:08:11,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:08:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions. [2019-12-27 14:08:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 14:08:11,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:11,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:11,949 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:11,949 INFO L82 PathProgramCache]: Analyzing trace with hash 944727824, now seen corresponding path program 1 times [2019-12-27 14:08:11,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:11,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983570407] [2019-12-27 14:08:11,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:12,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983570407] [2019-12-27 14:08:12,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:12,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:08:12,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2878973] [2019-12-27 14:08:12,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:08:12,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:12,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:08:12,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:08:12,026 INFO L87 Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states. [2019-12-27 14:08:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:12,086 INFO L93 Difference]: Finished difference Result 10212 states and 31246 transitions. [2019-12-27 14:08:12,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:08:12,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 14:08:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:12,111 INFO L225 Difference]: With dead ends: 10212 [2019-12-27 14:08:12,111 INFO L226 Difference]: Without dead ends: 8507 [2019-12-27 14:08:12,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2019-12-27 14:08:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459. [2019-12-27 14:08:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8459 states. [2019-12-27 14:08:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions. [2019-12-27 14:08:12,234 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54 [2019-12-27 14:08:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:12,234 INFO L462 AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions. [2019-12-27 14:08:12,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:08:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions. [2019-12-27 14:08:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 14:08:12,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:12,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:12,239 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:12,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1459800295, now seen corresponding path program 1 times [2019-12-27 14:08:12,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:12,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435272630] [2019-12-27 14:08:12,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:12,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435272630] [2019-12-27 14:08:12,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:12,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:08:12,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040044120] [2019-12-27 14:08:12,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:08:12,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:12,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:08:12,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:08:12,317 INFO L87 Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states. [2019-12-27 14:08:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:12,428 INFO L93 Difference]: Finished difference Result 9706 states and 29104 transitions. [2019-12-27 14:08:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:08:12,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 14:08:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:12,445 INFO L225 Difference]: With dead ends: 9706 [2019-12-27 14:08:12,446 INFO L226 Difference]: Without dead ends: 9706 [2019-12-27 14:08:12,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-12-27 14:08:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879. [2019-12-27 14:08:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8879 states. [2019-12-27 14:08:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions. [2019-12-27 14:08:12,638 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61 [2019-12-27 14:08:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:12,638 INFO L462 AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions. [2019-12-27 14:08:12,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:08:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions. [2019-12-27 14:08:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 14:08:12,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:12,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:12,641 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash 283010040, now seen corresponding path program 1 times [2019-12-27 14:08:12,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:12,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826784996] [2019-12-27 14:08:12,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:12,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826784996] [2019-12-27 14:08:12,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:12,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:08:12,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356649426] [2019-12-27 14:08:12,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:08:12,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:12,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:08:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:08:12,722 INFO L87 Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states. [2019-12-27 14:08:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:13,119 INFO L93 Difference]: Finished difference Result 11195 states and 33075 transitions. [2019-12-27 14:08:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 14:08:13,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 14:08:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:13,135 INFO L225 Difference]: With dead ends: 11195 [2019-12-27 14:08:13,135 INFO L226 Difference]: Without dead ends: 11134 [2019-12-27 14:08:13,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:08:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2019-12-27 14:08:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410. [2019-12-27 14:08:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10410 states. [2019-12-27 14:08:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions. [2019-12-27 14:08:13,276 INFO L78 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61 [2019-12-27 14:08:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:13,276 INFO L462 AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions. [2019-12-27 14:08:13,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:08:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions. [2019-12-27 14:08:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:08:13,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:13,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:13,282 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:13,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:13,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2090643056, now seen corresponding path program 1 times [2019-12-27 14:08:13,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:13,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520693197] [2019-12-27 14:08:13,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:13,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520693197] [2019-12-27 14:08:13,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:13,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:08:13,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75169538] [2019-12-27 14:08:13,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:08:13,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:13,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:08:13,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:08:13,322 INFO L87 Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 4 states. [2019-12-27 14:08:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:13,713 INFO L93 Difference]: Finished difference Result 15178 states and 44225 transitions. [2019-12-27 14:08:13,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:08:13,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 14:08:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:13,734 INFO L225 Difference]: With dead ends: 15178 [2019-12-27 14:08:13,734 INFO L226 Difference]: Without dead ends: 15178 [2019-12-27 14:08:13,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2019-12-27 14:08:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727. [2019-12-27 14:08:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-27 14:08:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions. [2019-12-27 14:08:13,903 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67 [2019-12-27 14:08:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:13,903 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions. [2019-12-27 14:08:13,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:08:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions. [2019-12-27 14:08:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:08:13,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:13,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:13,911 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash -959559759, now seen corresponding path program 1 times [2019-12-27 14:08:13,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:13,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787873633] [2019-12-27 14:08:13,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:14,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787873633] [2019-12-27 14:08:14,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:14,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:08:14,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126494547] [2019-12-27 14:08:14,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:08:14,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:14,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:08:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:08:14,002 INFO L87 Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 6 states. [2019-12-27 14:08:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:14,393 INFO L93 Difference]: Finished difference Result 12772 states and 36832 transitions. [2019-12-27 14:08:14,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 14:08:14,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 14:08:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:14,416 INFO L225 Difference]: With dead ends: 12772 [2019-12-27 14:08:14,416 INFO L226 Difference]: Without dead ends: 12772 [2019-12-27 14:08:14,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:08:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2019-12-27 14:08:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925. [2019-12-27 14:08:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11925 states. [2019-12-27 14:08:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions. [2019-12-27 14:08:14,640 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67 [2019-12-27 14:08:14,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:14,641 INFO L462 AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions. [2019-12-27 14:08:14,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:08:14,641 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions. [2019-12-27 14:08:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:08:14,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:14,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:14,648 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash -748208846, now seen corresponding path program 1 times [2019-12-27 14:08:14,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:14,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713451368] [2019-12-27 14:08:14,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:14,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713451368] [2019-12-27 14:08:14,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:14,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:08:14,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680971622] [2019-12-27 14:08:14,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:08:14,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:14,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:08:14,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:14,717 INFO L87 Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 5 states. [2019-12-27 14:08:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:15,126 INFO L93 Difference]: Finished difference Result 15220 states and 44029 transitions. [2019-12-27 14:08:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:08:15,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 14:08:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:15,153 INFO L225 Difference]: With dead ends: 15220 [2019-12-27 14:08:15,153 INFO L226 Difference]: Without dead ends: 15220 [2019-12-27 14:08:15,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:08:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15220 states. [2019-12-27 14:08:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156. [2019-12-27 14:08:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-12-27 14:08:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions. [2019-12-27 14:08:15,425 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67 [2019-12-27 14:08:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:15,425 INFO L462 AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions. [2019-12-27 14:08:15,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:08:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions. [2019-12-27 14:08:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:08:15,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:15,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:15,435 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:15,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1258743023, now seen corresponding path program 1 times [2019-12-27 14:08:15,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:15,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855755841] [2019-12-27 14:08:15,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:15,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855755841] [2019-12-27 14:08:15,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:15,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:08:15,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516678072] [2019-12-27 14:08:15,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:08:15,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:15,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:08:15,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:08:15,500 INFO L87 Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 4 states. [2019-12-27 14:08:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:16,163 INFO L93 Difference]: Finished difference Result 17525 states and 50589 transitions. [2019-12-27 14:08:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:08:16,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 14:08:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:16,188 INFO L225 Difference]: With dead ends: 17525 [2019-12-27 14:08:16,189 INFO L226 Difference]: Without dead ends: 17354 [2019-12-27 14:08:16,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17354 states. [2019-12-27 14:08:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 16508. [2019-12-27 14:08:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16508 states. [2019-12-27 14:08:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16508 states to 16508 states and 47592 transitions. [2019-12-27 14:08:16,409 INFO L78 Accepts]: Start accepts. Automaton has 16508 states and 47592 transitions. Word has length 67 [2019-12-27 14:08:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:16,410 INFO L462 AbstractCegarLoop]: Abstraction has 16508 states and 47592 transitions. [2019-12-27 14:08:16,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:08:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 16508 states and 47592 transitions. [2019-12-27 14:08:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:08:16,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:16,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:16,419 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:16,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1239272914, now seen corresponding path program 1 times [2019-12-27 14:08:16,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:16,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788632153] [2019-12-27 14:08:16,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:16,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788632153] [2019-12-27 14:08:16,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:16,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:08:16,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248523084] [2019-12-27 14:08:16,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:08:16,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:16,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:08:16,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:08:16,541 INFO L87 Difference]: Start difference. First operand 16508 states and 47592 transitions. Second operand 7 states. [2019-12-27 14:08:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:17,145 INFO L93 Difference]: Finished difference Result 21898 states and 61512 transitions. [2019-12-27 14:08:17,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 14:08:17,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 14:08:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:17,174 INFO L225 Difference]: With dead ends: 21898 [2019-12-27 14:08:17,174 INFO L226 Difference]: Without dead ends: 21898 [2019-12-27 14:08:17,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:08:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-12-27 14:08:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 18377. [2019-12-27 14:08:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-12-27 14:08:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 51655 transitions. [2019-12-27 14:08:17,438 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 51655 transitions. Word has length 67 [2019-12-27 14:08:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:17,439 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 51655 transitions. [2019-12-27 14:08:17,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:08:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 51655 transitions. [2019-12-27 14:08:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:08:17,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:17,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:17,447 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:17,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2126776595, now seen corresponding path program 1 times [2019-12-27 14:08:17,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:17,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431406680] [2019-12-27 14:08:17,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:17,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431406680] [2019-12-27 14:08:17,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:17,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:08:17,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978984646] [2019-12-27 14:08:17,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:08:17,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:08:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:17,511 INFO L87 Difference]: Start difference. First operand 18377 states and 51655 transitions. Second operand 5 states. [2019-12-27 14:08:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:17,561 INFO L93 Difference]: Finished difference Result 5654 states and 13548 transitions. [2019-12-27 14:08:17,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:08:17,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 14:08:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:17,568 INFO L225 Difference]: With dead ends: 5654 [2019-12-27 14:08:17,568 INFO L226 Difference]: Without dead ends: 4682 [2019-12-27 14:08:17,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:08:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-12-27 14:08:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 3847. [2019-12-27 14:08:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-12-27 14:08:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 9034 transitions. [2019-12-27 14:08:17,635 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 9034 transitions. Word has length 67 [2019-12-27 14:08:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:17,635 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 9034 transitions. [2019-12-27 14:08:17,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:08:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 9034 transitions. [2019-12-27 14:08:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:08:17,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:17,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:17,641 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1987685399, now seen corresponding path program 1 times [2019-12-27 14:08:17,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:17,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379841345] [2019-12-27 14:08:17,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:17,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379841345] [2019-12-27 14:08:17,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:17,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:08:17,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050121962] [2019-12-27 14:08:17,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:08:17,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:17,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:08:17,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:08:17,682 INFO L87 Difference]: Start difference. First operand 3847 states and 9034 transitions. Second operand 3 states. [2019-12-27 14:08:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:17,715 INFO L93 Difference]: Finished difference Result 4819 states and 11125 transitions. [2019-12-27 14:08:17,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:08:17,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 14:08:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:17,721 INFO L225 Difference]: With dead ends: 4819 [2019-12-27 14:08:17,722 INFO L226 Difference]: Without dead ends: 4819 [2019-12-27 14:08:17,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:08:17,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-12-27 14:08:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3790. [2019-12-27 14:08:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2019-12-27 14:08:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 8687 transitions. [2019-12-27 14:08:17,772 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 8687 transitions. Word has length 67 [2019-12-27 14:08:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:17,772 INFO L462 AbstractCegarLoop]: Abstraction has 3790 states and 8687 transitions. [2019-12-27 14:08:17,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:08:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 8687 transitions. [2019-12-27 14:08:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 14:08:17,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:17,776 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash -788602436, now seen corresponding path program 1 times [2019-12-27 14:08:17,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:17,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382102841] [2019-12-27 14:08:17,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:17,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382102841] [2019-12-27 14:08:17,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:17,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:08:17,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830676518] [2019-12-27 14:08:17,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:08:17,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:08:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:17,828 INFO L87 Difference]: Start difference. First operand 3790 states and 8687 transitions. Second operand 5 states. [2019-12-27 14:08:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:17,986 INFO L93 Difference]: Finished difference Result 4737 states and 10904 transitions. [2019-12-27 14:08:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 14:08:17,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-27 14:08:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:17,993 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 14:08:17,994 INFO L226 Difference]: Without dead ends: 4737 [2019-12-27 14:08:17,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:08:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2019-12-27 14:08:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4176. [2019-12-27 14:08:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4176 states. [2019-12-27 14:08:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 9598 transitions. [2019-12-27 14:08:18,058 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 9598 transitions. Word has length 73 [2019-12-27 14:08:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:18,058 INFO L462 AbstractCegarLoop]: Abstraction has 4176 states and 9598 transitions. [2019-12-27 14:08:18,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:08:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 9598 transitions. [2019-12-27 14:08:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 14:08:18,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:18,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:18,064 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:18,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:18,064 INFO L82 PathProgramCache]: Analyzing trace with hash 954207899, now seen corresponding path program 1 times [2019-12-27 14:08:18,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:18,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223949023] [2019-12-27 14:08:18,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:18,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223949023] [2019-12-27 14:08:18,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:18,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:08:18,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070691100] [2019-12-27 14:08:18,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:08:18,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:18,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:08:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:08:18,140 INFO L87 Difference]: Start difference. First operand 4176 states and 9598 transitions. Second operand 7 states. [2019-12-27 14:08:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:18,616 INFO L93 Difference]: Finished difference Result 4873 states and 11063 transitions. [2019-12-27 14:08:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 14:08:18,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-27 14:08:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:18,623 INFO L225 Difference]: With dead ends: 4873 [2019-12-27 14:08:18,624 INFO L226 Difference]: Without dead ends: 4820 [2019-12-27 14:08:18,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 14:08:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2019-12-27 14:08:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4234. [2019-12-27 14:08:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2019-12-27 14:08:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 9647 transitions. [2019-12-27 14:08:18,667 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 9647 transitions. Word has length 73 [2019-12-27 14:08:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:18,667 INFO L462 AbstractCegarLoop]: Abstraction has 4234 states and 9647 transitions. [2019-12-27 14:08:18,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:08:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 9647 transitions. [2019-12-27 14:08:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:08:18,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:18,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:18,672 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:18,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1009148223, now seen corresponding path program 1 times [2019-12-27 14:08:18,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:18,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947183976] [2019-12-27 14:08:18,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:18,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947183976] [2019-12-27 14:08:18,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:18,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:08:18,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954981014] [2019-12-27 14:08:18,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:08:18,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:08:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:08:18,727 INFO L87 Difference]: Start difference. First operand 4234 states and 9647 transitions. Second operand 3 states. [2019-12-27 14:08:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:18,884 INFO L93 Difference]: Finished difference Result 5804 states and 12895 transitions. [2019-12-27 14:08:18,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:08:18,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 14:08:18,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:18,891 INFO L225 Difference]: With dead ends: 5804 [2019-12-27 14:08:18,891 INFO L226 Difference]: Without dead ends: 5513 [2019-12-27 14:08:18,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:08:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2019-12-27 14:08:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5040. [2019-12-27 14:08:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5040 states. [2019-12-27 14:08:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5040 states to 5040 states and 11341 transitions. [2019-12-27 14:08:18,944 INFO L78 Accepts]: Start accepts. Automaton has 5040 states and 11341 transitions. Word has length 94 [2019-12-27 14:08:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:18,944 INFO L462 AbstractCegarLoop]: Abstraction has 5040 states and 11341 transitions. [2019-12-27 14:08:18,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:08:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5040 states and 11341 transitions. [2019-12-27 14:08:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:08:18,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:18,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:18,949 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash -725997759, now seen corresponding path program 1 times [2019-12-27 14:08:18,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:18,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815220554] [2019-12-27 14:08:18,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:19,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815220554] [2019-12-27 14:08:19,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:19,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:08:19,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598161034] [2019-12-27 14:08:19,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:08:19,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:19,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:08:19,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:08:19,073 INFO L87 Difference]: Start difference. First operand 5040 states and 11341 transitions. Second operand 4 states. [2019-12-27 14:08:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:19,166 INFO L93 Difference]: Finished difference Result 5316 states and 12003 transitions. [2019-12-27 14:08:19,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:08:19,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-27 14:08:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:19,174 INFO L225 Difference]: With dead ends: 5316 [2019-12-27 14:08:19,174 INFO L226 Difference]: Without dead ends: 5316 [2019-12-27 14:08:19,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2019-12-27 14:08:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4773. [2019-12-27 14:08:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4773 states. [2019-12-27 14:08:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 10838 transitions. [2019-12-27 14:08:19,246 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 10838 transitions. Word has length 94 [2019-12-27 14:08:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:19,246 INFO L462 AbstractCegarLoop]: Abstraction has 4773 states and 10838 transitions. [2019-12-27 14:08:19,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:08:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 10838 transitions. [2019-12-27 14:08:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 14:08:19,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:19,253 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:19,253 INFO L82 PathProgramCache]: Analyzing trace with hash 574359335, now seen corresponding path program 1 times [2019-12-27 14:08:19,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:19,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664796037] [2019-12-27 14:08:19,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:19,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664796037] [2019-12-27 14:08:19,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:19,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:08:19,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58431083] [2019-12-27 14:08:19,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:08:19,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:19,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:08:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:19,320 INFO L87 Difference]: Start difference. First operand 4773 states and 10838 transitions. Second operand 5 states. [2019-12-27 14:08:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:19,426 INFO L93 Difference]: Finished difference Result 5452 states and 12346 transitions. [2019-12-27 14:08:19,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:08:19,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-27 14:08:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:19,434 INFO L225 Difference]: With dead ends: 5452 [2019-12-27 14:08:19,434 INFO L226 Difference]: Without dead ends: 5452 [2019-12-27 14:08:19,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:08:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-27 14:08:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4174. [2019-12-27 14:08:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-27 14:08:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9445 transitions. [2019-12-27 14:08:19,507 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 9445 transitions. Word has length 96 [2019-12-27 14:08:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:19,508 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 9445 transitions. [2019-12-27 14:08:19,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:08:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 9445 transitions. [2019-12-27 14:08:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 14:08:19,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:19,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:19,514 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:19,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash 585675462, now seen corresponding path program 1 times [2019-12-27 14:08:19,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:19,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089936558] [2019-12-27 14:08:19,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:19,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089936558] [2019-12-27 14:08:19,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:19,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:08:19,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093036827] [2019-12-27 14:08:19,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:08:19,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:08:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:08:19,580 INFO L87 Difference]: Start difference. First operand 4174 states and 9445 transitions. Second operand 4 states. [2019-12-27 14:08:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:19,832 INFO L93 Difference]: Finished difference Result 4884 states and 10994 transitions. [2019-12-27 14:08:19,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:08:19,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-27 14:08:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:19,838 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 14:08:19,838 INFO L226 Difference]: Without dead ends: 4828 [2019-12-27 14:08:19,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:08:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2019-12-27 14:08:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4625. [2019-12-27 14:08:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-27 14:08:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 10444 transitions. [2019-12-27 14:08:19,885 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 10444 transitions. Word has length 96 [2019-12-27 14:08:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:19,885 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 10444 transitions. [2019-12-27 14:08:19,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:08:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 10444 transitions. [2019-12-27 14:08:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 14:08:19,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:19,891 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:19,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:19,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1491533881, now seen corresponding path program 1 times [2019-12-27 14:08:19,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:19,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059883525] [2019-12-27 14:08:19,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:20,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059883525] [2019-12-27 14:08:20,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:20,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 14:08:20,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617326] [2019-12-27 14:08:20,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 14:08:20,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 14:08:20,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:08:20,061 INFO L87 Difference]: Start difference. First operand 4625 states and 10444 transitions. Second operand 9 states. [2019-12-27 14:08:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:20,830 INFO L93 Difference]: Finished difference Result 6285 states and 13941 transitions. [2019-12-27 14:08:20,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 14:08:20,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 14:08:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:20,839 INFO L225 Difference]: With dead ends: 6285 [2019-12-27 14:08:20,839 INFO L226 Difference]: Without dead ends: 6285 [2019-12-27 14:08:20,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-27 14:08:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2019-12-27 14:08:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 5107. [2019-12-27 14:08:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2019-12-27 14:08:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 11442 transitions. [2019-12-27 14:08:20,906 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 11442 transitions. Word has length 96 [2019-12-27 14:08:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:20,907 INFO L462 AbstractCegarLoop]: Abstraction has 5107 states and 11442 transitions. [2019-12-27 14:08:20,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 14:08:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 11442 transitions. [2019-12-27 14:08:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 14:08:20,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:20,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:20,912 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:20,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1280182968, now seen corresponding path program 1 times [2019-12-27 14:08:20,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:20,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107797921] [2019-12-27 14:08:20,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:21,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107797921] [2019-12-27 14:08:21,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:21,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 14:08:21,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38980083] [2019-12-27 14:08:21,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 14:08:21,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 14:08:21,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:08:21,089 INFO L87 Difference]: Start difference. First operand 5107 states and 11442 transitions. Second operand 9 states. [2019-12-27 14:08:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:21,766 INFO L93 Difference]: Finished difference Result 6373 states and 14097 transitions. [2019-12-27 14:08:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 14:08:21,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 14:08:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:21,775 INFO L225 Difference]: With dead ends: 6373 [2019-12-27 14:08:21,775 INFO L226 Difference]: Without dead ends: 6355 [2019-12-27 14:08:21,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-27 14:08:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-12-27 14:08:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5470. [2019-12-27 14:08:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-12-27 14:08:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 12131 transitions. [2019-12-27 14:08:21,866 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 12131 transitions. Word has length 96 [2019-12-27 14:08:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:21,866 INFO L462 AbstractCegarLoop]: Abstraction has 5470 states and 12131 transitions. [2019-12-27 14:08:21,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 14:08:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 12131 transitions. [2019-12-27 14:08:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 14:08:21,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:21,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:21,875 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:21,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:21,875 INFO L82 PathProgramCache]: Analyzing trace with hash -392679287, now seen corresponding path program 1 times [2019-12-27 14:08:21,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:21,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277166148] [2019-12-27 14:08:21,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:08:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:08:22,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277166148] [2019-12-27 14:08:22,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:08:22,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 14:08:22,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111066987] [2019-12-27 14:08:22,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 14:08:22,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:08:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 14:08:22,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:08:22,030 INFO L87 Difference]: Start difference. First operand 5470 states and 12131 transitions. Second operand 10 states. [2019-12-27 14:08:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:08:22,674 INFO L93 Difference]: Finished difference Result 17542 states and 39329 transitions. [2019-12-27 14:08:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 14:08:22,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 14:08:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:08:22,693 INFO L225 Difference]: With dead ends: 17542 [2019-12-27 14:08:22,693 INFO L226 Difference]: Without dead ends: 11338 [2019-12-27 14:08:22,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 14:08:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11338 states. [2019-12-27 14:08:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11338 to 5429. [2019-12-27 14:08:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2019-12-27 14:08:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 11955 transitions. [2019-12-27 14:08:22,854 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 11955 transitions. Word has length 96 [2019-12-27 14:08:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:08:22,854 INFO L462 AbstractCegarLoop]: Abstraction has 5429 states and 11955 transitions. [2019-12-27 14:08:22,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 14:08:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 11955 transitions. [2019-12-27 14:08:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 14:08:22,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:08:22,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:08:22,863 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:08:22,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:08:22,863 INFO L82 PathProgramCache]: Analyzing trace with hash -325970013, now seen corresponding path program 2 times [2019-12-27 14:08:22,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:08:22,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977154979] [2019-12-27 14:08:22,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:08:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:08:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:08:23,011 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 14:08:23,011 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 14:08:23,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:08:23 BasicIcfg [2019-12-27 14:08:23,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 14:08:23,238 INFO L168 Benchmark]: Toolchain (without parser) took 50528.01 ms. Allocated memory was 145.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 101.6 MB in the beginning and 954.5 MB in the end (delta: -852.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 14:08:23,239 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 14:08:23,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.65 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 156.9 MB in the end (delta: -55.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 14:08:23,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.39 ms. Allocated memory is still 202.4 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 14:08:23,241 INFO L168 Benchmark]: Boogie Preprocessor took 42.04 ms. Allocated memory is still 202.4 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 14:08:23,241 INFO L168 Benchmark]: RCFGBuilder took 777.72 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 108.4 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-27 14:08:23,242 INFO L168 Benchmark]: TraceAbstraction took 48876.93 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 107.7 MB in the beginning and 954.5 MB in the end (delta: -846.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 14:08:23,245 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.74 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.65 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 156.9 MB in the end (delta: -55.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.39 ms. Allocated memory is still 202.4 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.04 ms. Allocated memory is still 202.4 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.72 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 108.4 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48876.93 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 107.7 MB in the beginning and 954.5 MB in the end (delta: -846.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t2315; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t2315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 pthread_t t2316; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] FCALL, FORK 0 pthread_create(&t2316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L809] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.4s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7834 SDtfs, 8908 SDslu, 18010 SDs, 0 SdLazy, 6884 SolverSat, 434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 77 SyntacticMatches, 18 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 86547 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1997 NumberOfCodeBlocks, 1997 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1873 ConstructedInterpolants, 0 QuantifiedInterpolants, 364447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...