/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:04:55,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:04:55,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:04:55,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:04:55,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:04:55,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:04:55,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:04:55,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:04:55,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:04:55,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:04:55,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:04:55,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:04:55,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:04:55,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:04:55,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:04:55,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:04:55,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:04:55,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:04:55,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:04:55,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:04:55,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:04:55,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:04:55,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:04:55,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:04:55,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:04:55,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:04:55,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:04:55,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:04:55,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:04:55,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:04:55,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:04:55,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:04:55,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:04:55,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:04:55,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:04:55,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:04:55,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:04:55,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:04:55,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:04:55,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:04:55,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:04:55,474 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:04:55,488 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:04:55,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:04:55,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:04:55,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:04:55,491 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:04:55,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:04:55,491 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:04:55,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:04:55,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:04:55,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:04:55,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:04:55,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:04:55,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:04:55,492 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:04:55,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:04:55,493 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:04:55,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:04:55,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:04:55,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:04:55,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:04:55,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:04:55,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:04:55,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:04:55,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:04:55,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:04:55,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:04:55,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:04:55,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:04:55,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:04:55,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:04:55,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:04:55,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:04:55,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:04:55,790 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:04:55,790 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:04:55,791 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_pso.oepc.i [2019-12-27 00:04:55,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef36b5c7e/5806e2790ef746d7b997aff4f9fdb78c/FLAG9e6c4cabe [2019-12-27 00:04:56,370 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:04:56,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_pso.oepc.i [2019-12-27 00:04:56,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef36b5c7e/5806e2790ef746d7b997aff4f9fdb78c/FLAG9e6c4cabe [2019-12-27 00:04:56,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef36b5c7e/5806e2790ef746d7b997aff4f9fdb78c [2019-12-27 00:04:56,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:04:56,734 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:04:56,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:04:56,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:04:56,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:04:56,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:04:56" (1/1) ... [2019-12-27 00:04:56,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2840a5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:56, skipping insertion in model container [2019-12-27 00:04:56,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:04:56" (1/1) ... [2019-12-27 00:04:56,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:04:56,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:04:57,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:04:57,364 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:04:57,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:04:57,517 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:04:57,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57 WrapperNode [2019-12-27 00:04:57,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:04:57,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:04:57,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:04:57,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:04:57,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (1/1) ... [2019-12-27 00:04:57,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (1/1) ... [2019-12-27 00:04:57,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:04:57,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:04:57,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:04:57,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:04:57,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (1/1) ... [2019-12-27 00:04:57,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (1/1) ... [2019-12-27 00:04:57,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (1/1) ... [2019-12-27 00:04:57,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (1/1) ... [2019-12-27 00:04:57,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (1/1) ... [2019-12-27 00:04:57,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (1/1) ... [2019-12-27 00:04:57,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (1/1) ... [2019-12-27 00:04:57,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:04:57,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:04:57,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:04:57,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:04:57,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (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 00:04:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:04:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:04:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:04:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:04:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:04:57,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:04:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:04:57,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:04:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:04:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:04:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:04:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:04:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:04:57,742 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 00:04:58,480 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:04:58,480 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:04:58,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:04:58 BoogieIcfgContainer [2019-12-27 00:04:58,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:04:58,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:04:58,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:04:58,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:04:58,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:04:56" (1/3) ... [2019-12-27 00:04:58,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd934dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:04:58, skipping insertion in model container [2019-12-27 00:04:58,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:57" (2/3) ... [2019-12-27 00:04:58,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd934dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:04:58, skipping insertion in model container [2019-12-27 00:04:58,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:04:58" (3/3) ... [2019-12-27 00:04:58,490 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_pso.oepc.i [2019-12-27 00:04:58,500 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:04:58,500 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:04:58,508 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:04:58,509 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:04:58,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,582 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,583 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,639 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,641 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,648 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:58,670 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:04:58,690 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:04:58,690 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:04:58,690 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:04:58,690 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:04:58,691 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:04:58,691 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:04:58,691 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:04:58,691 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:04:58,706 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 00:04:58,708 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 00:04:58,830 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 00:04:58,830 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:04:58,848 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 00:04:58,870 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 00:04:58,973 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 00:04:58,973 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:04:58,985 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 00:04:59,011 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 00:04:59,012 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:05:04,274 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 00:05:04,390 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 00:05:04,417 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-27 00:05:04,417 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 00:05:04,421 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-27 00:05:21,056 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-27 00:05:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-27 00:05:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:05:21,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:21,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:05:21,063 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:21,068 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-27 00:05:21,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:21,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667684787] [2019-12-27 00:05:21,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:21,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667684787] [2019-12-27 00:05:21,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:21,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:05:21,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234539123] [2019-12-27 00:05:21,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:05:21,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:05:21,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:05:21,271 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-27 00:05:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:22,504 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-27 00:05:22,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:05:22,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:05:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:23,151 INFO L225 Difference]: With dead ends: 108680 [2019-12-27 00:05:23,151 INFO L226 Difference]: Without dead ends: 102440 [2019-12-27 00:05:23,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 00:05:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-27 00:05:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-27 00:05:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-27 00:05:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-27 00:05:36,284 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-27 00:05:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:36,284 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-27 00:05:36,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:05:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-27 00:05:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:05:36,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:36,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:05:36,297 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-27 00:05:36,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:36,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117107786] [2019-12-27 00:05:36,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:36,447 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 00:05:36,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117107786] [2019-12-27 00:05:36,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:36,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:05:36,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165041544] [2019-12-27 00:05:36,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:05:36,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:36,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:05:36,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:05:36,451 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-27 00:05:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:42,183 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-27 00:05:42,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:05:42,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 00:05:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:42,968 INFO L225 Difference]: With dead ends: 163248 [2019-12-27 00:05:42,968 INFO L226 Difference]: Without dead ends: 163199 [2019-12-27 00:05:42,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 00:05:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-27 00:05:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-27 00:05:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-27 00:05:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-27 00:05:51,844 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-27 00:05:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:51,844 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-27 00:05:51,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:05:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-27 00:05:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:05:51,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:51,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:05:51,848 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-27 00:05:51,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:51,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542767712] [2019-12-27 00:05:51,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:51,931 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 00:05:51,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542767712] [2019-12-27 00:05:51,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:51,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:05:51,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894436940] [2019-12-27 00:05:51,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:05:51,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:05:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:05:51,933 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-27 00:05:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:58,080 INFO L93 Difference]: Finished difference Result 208779 states and 842772 transitions. [2019-12-27 00:05:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:05:58,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:05:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:58,720 INFO L225 Difference]: With dead ends: 208779 [2019-12-27 00:05:58,720 INFO L226 Difference]: Without dead ends: 208723 [2019-12-27 00:05:58,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 00:06:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208723 states. [2019-12-27 00:06:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208723 to 175996. [2019-12-27 00:06:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175996 states. [2019-12-27 00:06:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175996 states to 175996 states and 723083 transitions. [2019-12-27 00:06:17,700 INFO L78 Accepts]: Start accepts. Automaton has 175996 states and 723083 transitions. Word has length 13 [2019-12-27 00:06:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:17,702 INFO L462 AbstractCegarLoop]: Abstraction has 175996 states and 723083 transitions. [2019-12-27 00:06:17,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:06:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 175996 states and 723083 transitions. [2019-12-27 00:06:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:06:17,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:17,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:17,712 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:17,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:17,712 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-27 00:06:17,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:17,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685844375] [2019-12-27 00:06:17,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:17,801 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 00:06:17,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685844375] [2019-12-27 00:06:17,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:17,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:06:17,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192848821] [2019-12-27 00:06:17,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:06:17,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:17,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:06:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:06:17,807 INFO L87 Difference]: Start difference. First operand 175996 states and 723083 transitions. Second operand 5 states. [2019-12-27 00:06:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:19,363 INFO L93 Difference]: Finished difference Result 234922 states and 955485 transitions. [2019-12-27 00:06:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:06:19,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 00:06:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:27,602 INFO L225 Difference]: With dead ends: 234922 [2019-12-27 00:06:27,602 INFO L226 Difference]: Without dead ends: 234922 [2019-12-27 00:06:27,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 00:06:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234922 states. [2019-12-27 00:06:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234922 to 195490. [2019-12-27 00:06:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195490 states. [2019-12-27 00:06:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195490 states to 195490 states and 801473 transitions. [2019-12-27 00:06:37,316 INFO L78 Accepts]: Start accepts. Automaton has 195490 states and 801473 transitions. Word has length 16 [2019-12-27 00:06:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:37,317 INFO L462 AbstractCegarLoop]: Abstraction has 195490 states and 801473 transitions. [2019-12-27 00:06:37,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:06:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 195490 states and 801473 transitions. [2019-12-27 00:06:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:06:37,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:37,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:37,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1153162558, now seen corresponding path program 1 times [2019-12-27 00:06:37,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:37,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744822646] [2019-12-27 00:06:37,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:37,393 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 00:06:37,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744822646] [2019-12-27 00:06:37,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:37,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:06:37,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994130490] [2019-12-27 00:06:37,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:06:37,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:37,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:06:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:06:37,396 INFO L87 Difference]: Start difference. First operand 195490 states and 801473 transitions. Second operand 3 states. [2019-12-27 00:06:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:43,889 INFO L93 Difference]: Finished difference Result 195126 states and 800046 transitions. [2019-12-27 00:06:43,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:06:43,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 00:06:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:44,445 INFO L225 Difference]: With dead ends: 195126 [2019-12-27 00:06:44,445 INFO L226 Difference]: Without dead ends: 195126 [2019-12-27 00:06:44,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 00:06:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195126 states. [2019-12-27 00:06:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195126 to 195126. [2019-12-27 00:06:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195126 states. [2019-12-27 00:06:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195126 states to 195126 states and 800046 transitions. [2019-12-27 00:06:59,341 INFO L78 Accepts]: Start accepts. Automaton has 195126 states and 800046 transitions. Word has length 18 [2019-12-27 00:06:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:59,342 INFO L462 AbstractCegarLoop]: Abstraction has 195126 states and 800046 transitions. [2019-12-27 00:06:59,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:06:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 195126 states and 800046 transitions. [2019-12-27 00:06:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:06:59,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:59,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:59,362 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1951188865, now seen corresponding path program 1 times [2019-12-27 00:06:59,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:59,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614133147] [2019-12-27 00:06:59,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:59,434 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 00:06:59,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614133147] [2019-12-27 00:06:59,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:59,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:06:59,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433856976] [2019-12-27 00:06:59,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:06:59,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:59,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:06:59,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:06:59,436 INFO L87 Difference]: Start difference. First operand 195126 states and 800046 transitions. Second operand 4 states. [2019-12-27 00:07:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:08,374 INFO L93 Difference]: Finished difference Result 367409 states and 1507754 transitions. [2019-12-27 00:07:08,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:07:08,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 00:07:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:09,020 INFO L225 Difference]: With dead ends: 367409 [2019-12-27 00:07:09,020 INFO L226 Difference]: Without dead ends: 208324 [2019-12-27 00:07:09,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 00:07:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208324 states. [2019-12-27 00:07:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208324 to 206903. [2019-12-27 00:07:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206903 states. [2019-12-27 00:07:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206903 states to 206903 states and 837795 transitions. [2019-12-27 00:07:24,474 INFO L78 Accepts]: Start accepts. Automaton has 206903 states and 837795 transitions. Word has length 19 [2019-12-27 00:07:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:24,474 INFO L462 AbstractCegarLoop]: Abstraction has 206903 states and 837795 transitions. [2019-12-27 00:07:24,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:07:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 206903 states and 837795 transitions. [2019-12-27 00:07:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:07:24,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:24,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:07:24,493 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:24,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2060703810, now seen corresponding path program 1 times [2019-12-27 00:07:24,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:24,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783139329] [2019-12-27 00:07:24,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:24,563 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 00:07:24,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783139329] [2019-12-27 00:07:24,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:24,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:07:24,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887923367] [2019-12-27 00:07:24,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:07:24,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:07:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:07:24,566 INFO L87 Difference]: Start difference. First operand 206903 states and 837795 transitions. Second operand 4 states. [2019-12-27 00:07:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:24,817 INFO L93 Difference]: Finished difference Result 53084 states and 178612 transitions. [2019-12-27 00:07:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:07:24,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 00:07:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:24,884 INFO L225 Difference]: With dead ends: 53084 [2019-12-27 00:07:24,884 INFO L226 Difference]: Without dead ends: 41205 [2019-12-27 00:07:24,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 00:07:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41205 states. [2019-12-27 00:07:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41205 to 40210. [2019-12-27 00:07:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40210 states. [2019-12-27 00:07:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40210 states to 40210 states and 128989 transitions. [2019-12-27 00:07:31,116 INFO L78 Accepts]: Start accepts. Automaton has 40210 states and 128989 transitions. Word has length 19 [2019-12-27 00:07:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:31,116 INFO L462 AbstractCegarLoop]: Abstraction has 40210 states and 128989 transitions. [2019-12-27 00:07:31,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:07:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 40210 states and 128989 transitions. [2019-12-27 00:07:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:07:31,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:31,122 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] [2019-12-27 00:07:31,122 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-27 00:07:31,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:31,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574434258] [2019-12-27 00:07:31,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:07:31,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574434258] [2019-12-27 00:07:31,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:31,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:07:31,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750580483] [2019-12-27 00:07:31,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:07:31,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:31,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:07:31,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:07:31,220 INFO L87 Difference]: Start difference. First operand 40210 states and 128989 transitions. Second operand 6 states. [2019-12-27 00:07:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:32,095 INFO L93 Difference]: Finished difference Result 60602 states and 188612 transitions. [2019-12-27 00:07:32,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:07:32,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:07:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:32,195 INFO L225 Difference]: With dead ends: 60602 [2019-12-27 00:07:32,195 INFO L226 Difference]: Without dead ends: 60504 [2019-12-27 00:07:32,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:07:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60504 states. [2019-12-27 00:07:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60504 to 40348. [2019-12-27 00:07:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40348 states. [2019-12-27 00:07:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40348 states to 40348 states and 128423 transitions. [2019-12-27 00:07:33,346 INFO L78 Accepts]: Start accepts. Automaton has 40348 states and 128423 transitions. Word has length 22 [2019-12-27 00:07:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:33,346 INFO L462 AbstractCegarLoop]: Abstraction has 40348 states and 128423 transitions. [2019-12-27 00:07:33,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:07:33,346 INFO L276 IsEmpty]: Start isEmpty. Operand 40348 states and 128423 transitions. [2019-12-27 00:07:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:07:33,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:33,356 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] [2019-12-27 00:07:33,357 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:33,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:33,357 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-27 00:07:33,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:33,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180685264] [2019-12-27 00:07:33,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:33,456 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 00:07:33,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180685264] [2019-12-27 00:07:33,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:33,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:07:33,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022233664] [2019-12-27 00:07:33,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:07:33,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:33,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:07:33,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:07:33,458 INFO L87 Difference]: Start difference. First operand 40348 states and 128423 transitions. Second operand 5 states. [2019-12-27 00:07:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:33,999 INFO L93 Difference]: Finished difference Result 56186 states and 174944 transitions. [2019-12-27 00:07:33,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:07:33,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 00:07:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:34,099 INFO L225 Difference]: With dead ends: 56186 [2019-12-27 00:07:34,099 INFO L226 Difference]: Without dead ends: 55974 [2019-12-27 00:07:34,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 00:07:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55974 states. [2019-12-27 00:07:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55974 to 47425. [2019-12-27 00:07:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47425 states. [2019-12-27 00:07:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47425 states to 47425 states and 150377 transitions. [2019-12-27 00:07:35,508 INFO L78 Accepts]: Start accepts. Automaton has 47425 states and 150377 transitions. Word has length 25 [2019-12-27 00:07:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:35,509 INFO L462 AbstractCegarLoop]: Abstraction has 47425 states and 150377 transitions. [2019-12-27 00:07:35,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:07:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 47425 states and 150377 transitions. [2019-12-27 00:07:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:07:35,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:35,523 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] [2019-12-27 00:07:35,523 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-27 00:07:35,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:35,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288215433] [2019-12-27 00:07:35,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:35,587 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 00:07:35,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288215433] [2019-12-27 00:07:35,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:35,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:07:35,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661851160] [2019-12-27 00:07:35,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:07:35,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:35,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:07:35,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:07:35,589 INFO L87 Difference]: Start difference. First operand 47425 states and 150377 transitions. Second operand 6 states. [2019-12-27 00:07:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:36,290 INFO L93 Difference]: Finished difference Result 66982 states and 207084 transitions. [2019-12-27 00:07:36,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 00:07:36,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 00:07:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:36,400 INFO L225 Difference]: With dead ends: 66982 [2019-12-27 00:07:36,400 INFO L226 Difference]: Without dead ends: 66389 [2019-12-27 00:07:36,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:07:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66389 states. [2019-12-27 00:07:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66389 to 52066. [2019-12-27 00:07:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52066 states. [2019-12-27 00:07:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52066 states to 52066 states and 164051 transitions. [2019-12-27 00:07:37,949 INFO L78 Accepts]: Start accepts. Automaton has 52066 states and 164051 transitions. Word has length 27 [2019-12-27 00:07:37,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:37,949 INFO L462 AbstractCegarLoop]: Abstraction has 52066 states and 164051 transitions. [2019-12-27 00:07:37,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:07:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 52066 states and 164051 transitions. [2019-12-27 00:07:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 00:07:37,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:37,966 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] [2019-12-27 00:07:37,966 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:37,967 INFO L82 PathProgramCache]: Analyzing trace with hash -524022794, now seen corresponding path program 1 times [2019-12-27 00:07:37,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:37,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430792604] [2019-12-27 00:07:37,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:38,028 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 00:07:38,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430792604] [2019-12-27 00:07:38,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:38,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:07:38,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67332576] [2019-12-27 00:07:38,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:07:38,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:38,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:07:38,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:07:38,035 INFO L87 Difference]: Start difference. First operand 52066 states and 164051 transitions. Second operand 4 states. [2019-12-27 00:07:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:38,597 INFO L93 Difference]: Finished difference Result 118270 states and 380880 transitions. [2019-12-27 00:07:38,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:07:38,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 00:07:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:38,663 INFO L225 Difference]: With dead ends: 118270 [2019-12-27 00:07:38,663 INFO L226 Difference]: Without dead ends: 28049 [2019-12-27 00:07:38,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 00:07:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28049 states. [2019-12-27 00:07:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28049 to 27357. [2019-12-27 00:07:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27357 states. [2019-12-27 00:07:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27357 states to 27357 states and 84690 transitions. [2019-12-27 00:07:39,144 INFO L78 Accepts]: Start accepts. Automaton has 27357 states and 84690 transitions. Word has length 29 [2019-12-27 00:07:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:39,144 INFO L462 AbstractCegarLoop]: Abstraction has 27357 states and 84690 transitions. [2019-12-27 00:07:39,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:07:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 27357 states and 84690 transitions. [2019-12-27 00:07:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:07:39,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:39,157 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] [2019-12-27 00:07:39,157 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:39,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:39,158 INFO L82 PathProgramCache]: Analyzing trace with hash -116284186, now seen corresponding path program 1 times [2019-12-27 00:07:39,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:39,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614082975] [2019-12-27 00:07:39,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:39,230 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 00:07:39,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614082975] [2019-12-27 00:07:39,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:39,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:07:39,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144163049] [2019-12-27 00:07:39,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:07:39,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:39,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:07:39,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:07:39,232 INFO L87 Difference]: Start difference. First operand 27357 states and 84690 transitions. Second operand 5 states. [2019-12-27 00:07:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:39,892 INFO L93 Difference]: Finished difference Result 41160 states and 127027 transitions. [2019-12-27 00:07:39,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:07:39,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 00:07:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:39,955 INFO L225 Difference]: With dead ends: 41160 [2019-12-27 00:07:39,955 INFO L226 Difference]: Without dead ends: 41160 [2019-12-27 00:07:39,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:07:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41160 states. [2019-12-27 00:07:40,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41160 to 36991. [2019-12-27 00:07:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36991 states. [2019-12-27 00:07:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36991 states to 36991 states and 114873 transitions. [2019-12-27 00:07:40,899 INFO L78 Accepts]: Start accepts. Automaton has 36991 states and 114873 transitions. Word has length 30 [2019-12-27 00:07:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:40,899 INFO L462 AbstractCegarLoop]: Abstraction has 36991 states and 114873 transitions. [2019-12-27 00:07:40,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:07:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36991 states and 114873 transitions. [2019-12-27 00:07:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:07:40,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:40,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:07:40,917 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1132903455, now seen corresponding path program 1 times [2019-12-27 00:07:40,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:40,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646422169] [2019-12-27 00:07:40,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:40,994 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 00:07:40,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646422169] [2019-12-27 00:07:40,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:40,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:07:40,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268916339] [2019-12-27 00:07:40,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:07:40,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:40,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:07:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:07:40,996 INFO L87 Difference]: Start difference. First operand 36991 states and 114873 transitions. Second operand 5 states. [2019-12-27 00:07:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:41,750 INFO L93 Difference]: Finished difference Result 53889 states and 165459 transitions. [2019-12-27 00:07:41,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:07:41,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 00:07:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:41,838 INFO L225 Difference]: With dead ends: 53889 [2019-12-27 00:07:41,838 INFO L226 Difference]: Without dead ends: 53840 [2019-12-27 00:07:41,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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 00:07:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53840 states. [2019-12-27 00:07:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53840 to 44806. [2019-12-27 00:07:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44806 states. [2019-12-27 00:07:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44806 states to 44806 states and 139518 transitions. [2019-12-27 00:07:43,012 INFO L78 Accepts]: Start accepts. Automaton has 44806 states and 139518 transitions. Word has length 30 [2019-12-27 00:07:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:43,013 INFO L462 AbstractCegarLoop]: Abstraction has 44806 states and 139518 transitions. [2019-12-27 00:07:43,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:07:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 44806 states and 139518 transitions. [2019-12-27 00:07:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:07:43,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:43,031 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] [2019-12-27 00:07:43,032 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1026319235, now seen corresponding path program 1 times [2019-12-27 00:07:43,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:43,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304217594] [2019-12-27 00:07:43,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:43,088 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 00:07:43,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304217594] [2019-12-27 00:07:43,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:43,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:07:43,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540668360] [2019-12-27 00:07:43,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:07:43,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:07:43,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:07:43,090 INFO L87 Difference]: Start difference. First operand 44806 states and 139518 transitions. Second operand 5 states. [2019-12-27 00:07:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:43,259 INFO L93 Difference]: Finished difference Result 21943 states and 64706 transitions. [2019-12-27 00:07:43,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:07:43,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 00:07:43,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:43,302 INFO L225 Difference]: With dead ends: 21943 [2019-12-27 00:07:43,302 INFO L226 Difference]: Without dead ends: 19299 [2019-12-27 00:07:43,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 00:07:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19299 states. [2019-12-27 00:07:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19299 to 18143. [2019-12-27 00:07:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-12-27 00:07:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 53716 transitions. [2019-12-27 00:07:43,730 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 53716 transitions. Word has length 31 [2019-12-27 00:07:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:43,730 INFO L462 AbstractCegarLoop]: Abstraction has 18143 states and 53716 transitions. [2019-12-27 00:07:43,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:07:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 53716 transitions. [2019-12-27 00:07:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 00:07:43,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:43,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:07:43,752 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:43,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-27 00:07:43,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:43,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799871670] [2019-12-27 00:07:43,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:43,861 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 00:07:43,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799871670] [2019-12-27 00:07:43,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:43,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:07:43,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605189879] [2019-12-27 00:07:43,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:07:43,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:07:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:07:43,863 INFO L87 Difference]: Start difference. First operand 18143 states and 53716 transitions. Second operand 7 states. [2019-12-27 00:07:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:44,623 INFO L93 Difference]: Finished difference Result 19608 states and 56880 transitions. [2019-12-27 00:07:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 00:07:44,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 00:07:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:44,656 INFO L225 Difference]: With dead ends: 19608 [2019-12-27 00:07:44,656 INFO L226 Difference]: Without dead ends: 18921 [2019-12-27 00:07:44,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:07:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18921 states. [2019-12-27 00:07:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18921 to 17152. [2019-12-27 00:07:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17152 states. [2019-12-27 00:07:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17152 states to 17152 states and 50369 transitions. [2019-12-27 00:07:44,912 INFO L78 Accepts]: Start accepts. Automaton has 17152 states and 50369 transitions. Word has length 33 [2019-12-27 00:07:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:44,913 INFO L462 AbstractCegarLoop]: Abstraction has 17152 states and 50369 transitions. [2019-12-27 00:07:44,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:07:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 17152 states and 50369 transitions. [2019-12-27 00:07:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 00:07:44,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:44,935 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] [2019-12-27 00:07:44,935 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash -739159160, now seen corresponding path program 1 times [2019-12-27 00:07:44,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:44,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323853063] [2019-12-27 00:07:44,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:45,038 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 00:07:45,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323853063] [2019-12-27 00:07:45,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:45,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:07:45,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047676184] [2019-12-27 00:07:45,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:07:45,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:07:45,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:07:45,040 INFO L87 Difference]: Start difference. First operand 17152 states and 50369 transitions. Second operand 6 states. [2019-12-27 00:07:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:46,186 INFO L93 Difference]: Finished difference Result 22796 states and 65727 transitions. [2019-12-27 00:07:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:07:46,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 00:07:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:46,216 INFO L225 Difference]: With dead ends: 22796 [2019-12-27 00:07:46,216 INFO L226 Difference]: Without dead ends: 22796 [2019-12-27 00:07:46,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:07:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22796 states. [2019-12-27 00:07:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22796 to 17194. [2019-12-27 00:07:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17194 states. [2019-12-27 00:07:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17194 states to 17194 states and 50488 transitions. [2019-12-27 00:07:46,482 INFO L78 Accepts]: Start accepts. Automaton has 17194 states and 50488 transitions. Word has length 40 [2019-12-27 00:07:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:46,483 INFO L462 AbstractCegarLoop]: Abstraction has 17194 states and 50488 transitions. [2019-12-27 00:07:46,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:07:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 17194 states and 50488 transitions. [2019-12-27 00:07:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 00:07:46,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:46,503 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] [2019-12-27 00:07:46,503 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1031083350, now seen corresponding path program 2 times [2019-12-27 00:07:46,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:46,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254453951] [2019-12-27 00:07:46,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:46,564 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 00:07:46,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254453951] [2019-12-27 00:07:46,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:46,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:07:46,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84645769] [2019-12-27 00:07:46,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:07:46,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:46,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:07:46,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:07:46,566 INFO L87 Difference]: Start difference. First operand 17194 states and 50488 transitions. Second operand 3 states. [2019-12-27 00:07:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:46,635 INFO L93 Difference]: Finished difference Result 13828 states and 39650 transitions. [2019-12-27 00:07:46,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:07:46,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 00:07:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:46,660 INFO L225 Difference]: With dead ends: 13828 [2019-12-27 00:07:46,661 INFO L226 Difference]: Without dead ends: 13828 [2019-12-27 00:07:46,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 00:07:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13828 states. [2019-12-27 00:07:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13828 to 13824. [2019-12-27 00:07:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13824 states. [2019-12-27 00:07:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13824 states to 13824 states and 39642 transitions. [2019-12-27 00:07:46,919 INFO L78 Accepts]: Start accepts. Automaton has 13824 states and 39642 transitions. Word has length 40 [2019-12-27 00:07:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:46,919 INFO L462 AbstractCegarLoop]: Abstraction has 13824 states and 39642 transitions. [2019-12-27 00:07:46,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:07:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 13824 states and 39642 transitions. [2019-12-27 00:07:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:07:46,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:46,931 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] [2019-12-27 00:07:46,932 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:46,932 INFO L82 PathProgramCache]: Analyzing trace with hash 234062339, now seen corresponding path program 1 times [2019-12-27 00:07:46,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:46,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419447794] [2019-12-27 00:07:46,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:46,978 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 00:07:46,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419447794] [2019-12-27 00:07:46,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:46,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:07:46,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226095871] [2019-12-27 00:07:46,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:07:46,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:07:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:07:46,980 INFO L87 Difference]: Start difference. First operand 13824 states and 39642 transitions. Second operand 3 states. [2019-12-27 00:07:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:47,050 INFO L93 Difference]: Finished difference Result 13762 states and 39441 transitions. [2019-12-27 00:07:47,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:07:47,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 00:07:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:47,074 INFO L225 Difference]: With dead ends: 13762 [2019-12-27 00:07:47,074 INFO L226 Difference]: Without dead ends: 13762 [2019-12-27 00:07:47,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 00:07:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2019-12-27 00:07:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 12106. [2019-12-27 00:07:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12106 states. [2019-12-27 00:07:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12106 states to 12106 states and 35067 transitions. [2019-12-27 00:07:47,315 INFO L78 Accepts]: Start accepts. Automaton has 12106 states and 35067 transitions. Word has length 41 [2019-12-27 00:07:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:47,316 INFO L462 AbstractCegarLoop]: Abstraction has 12106 states and 35067 transitions. [2019-12-27 00:07:47,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:07:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12106 states and 35067 transitions. [2019-12-27 00:07:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 00:07:47,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:47,328 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] [2019-12-27 00:07:47,328 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1386848900, now seen corresponding path program 1 times [2019-12-27 00:07:47,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:47,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419637362] [2019-12-27 00:07:47,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:07:47,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419637362] [2019-12-27 00:07:47,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:47,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:07:47,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341177055] [2019-12-27 00:07:47,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:07:47,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:07:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:07:47,409 INFO L87 Difference]: Start difference. First operand 12106 states and 35067 transitions. Second operand 6 states. [2019-12-27 00:07:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:47,519 INFO L93 Difference]: Finished difference Result 11274 states and 33248 transitions. [2019-12-27 00:07:47,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:07:47,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 00:07:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:47,534 INFO L225 Difference]: With dead ends: 11274 [2019-12-27 00:07:47,534 INFO L226 Difference]: Without dead ends: 9070 [2019-12-27 00:07:47,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:07:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9070 states. [2019-12-27 00:07:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9070 to 9070. [2019-12-27 00:07:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9070 states. [2019-12-27 00:07:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 28236 transitions. [2019-12-27 00:07:47,673 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 28236 transitions. Word has length 42 [2019-12-27 00:07:47,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:47,673 INFO L462 AbstractCegarLoop]: Abstraction has 9070 states and 28236 transitions. [2019-12-27 00:07:47,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:07:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 28236 transitions. [2019-12-27 00:07:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:07:47,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:47,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:07:47,682 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:47,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-27 00:07:47,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:47,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201711361] [2019-12-27 00:07:47,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:47,721 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 00:07:47,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201711361] [2019-12-27 00:07:47,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:47,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:07:47,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576617857] [2019-12-27 00:07:47,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:07:47,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:47,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:07:47,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:07:47,723 INFO L87 Difference]: Start difference. First operand 9070 states and 28236 transitions. Second operand 3 states. [2019-12-27 00:07:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:47,799 INFO L93 Difference]: Finished difference Result 13366 states and 41764 transitions. [2019-12-27 00:07:47,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:07:47,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 00:07:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:47,817 INFO L225 Difference]: With dead ends: 13366 [2019-12-27 00:07:47,817 INFO L226 Difference]: Without dead ends: 13366 [2019-12-27 00:07:47,817 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 00:07:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-27 00:07:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11014. [2019-12-27 00:07:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11014 states. [2019-12-27 00:07:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11014 states to 11014 states and 34672 transitions. [2019-12-27 00:07:48,006 INFO L78 Accepts]: Start accepts. Automaton has 11014 states and 34672 transitions. Word has length 66 [2019-12-27 00:07:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:48,006 INFO L462 AbstractCegarLoop]: Abstraction has 11014 states and 34672 transitions. [2019-12-27 00:07:48,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:07:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 11014 states and 34672 transitions. [2019-12-27 00:07:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:07:48,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:48,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:07:48,018 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-27 00:07:48,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:48,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748941317] [2019-12-27 00:07:48,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:48,298 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 00:07:48,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748941317] [2019-12-27 00:07:48,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:48,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:07:48,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764399439] [2019-12-27 00:07:48,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:07:48,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:07:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:07:48,300 INFO L87 Difference]: Start difference. First operand 11014 states and 34672 transitions. Second operand 3 states. [2019-12-27 00:07:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:48,388 INFO L93 Difference]: Finished difference Result 13366 states and 40402 transitions. [2019-12-27 00:07:48,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:07:48,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 00:07:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:48,412 INFO L225 Difference]: With dead ends: 13366 [2019-12-27 00:07:48,412 INFO L226 Difference]: Without dead ends: 13366 [2019-12-27 00:07:48,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:07:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-27 00:07:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 10822. [2019-12-27 00:07:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10822 states. [2019-12-27 00:07:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10822 states to 10822 states and 32790 transitions. [2019-12-27 00:07:48,609 INFO L78 Accepts]: Start accepts. Automaton has 10822 states and 32790 transitions. Word has length 66 [2019-12-27 00:07:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:48,610 INFO L462 AbstractCegarLoop]: Abstraction has 10822 states and 32790 transitions. [2019-12-27 00:07:48,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:07:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 10822 states and 32790 transitions. [2019-12-27 00:07:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:07:48,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:48,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:07:48,620 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:48,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-27 00:07:48,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:48,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889194384] [2019-12-27 00:07:48,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:48,717 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 00:07:48,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889194384] [2019-12-27 00:07:48,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:48,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:07:48,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201754838] [2019-12-27 00:07:48,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:07:48,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:48,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:07:48,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:07:48,719 INFO L87 Difference]: Start difference. First operand 10822 states and 32790 transitions. Second operand 7 states. [2019-12-27 00:07:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:49,120 INFO L93 Difference]: Finished difference Result 20681 states and 61631 transitions. [2019-12-27 00:07:49,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:07:49,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 00:07:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:49,153 INFO L225 Difference]: With dead ends: 20681 [2019-12-27 00:07:49,153 INFO L226 Difference]: Without dead ends: 14543 [2019-12-27 00:07:49,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:07:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14543 states. [2019-12-27 00:07:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14543 to 12441. [2019-12-27 00:07:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12441 states. [2019-12-27 00:07:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12441 states to 12441 states and 37169 transitions. [2019-12-27 00:07:49,567 INFO L78 Accepts]: Start accepts. Automaton has 12441 states and 37169 transitions. Word has length 66 [2019-12-27 00:07:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:49,568 INFO L462 AbstractCegarLoop]: Abstraction has 12441 states and 37169 transitions. [2019-12-27 00:07:49,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:07:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 12441 states and 37169 transitions. [2019-12-27 00:07:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:07:49,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:49,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:07:49,594 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 659069437, now seen corresponding path program 2 times [2019-12-27 00:07:49,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:49,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134839501] [2019-12-27 00:07:49,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:49,691 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 00:07:49,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134839501] [2019-12-27 00:07:49,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:49,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:07:49,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958545126] [2019-12-27 00:07:49,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:07:49,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:49,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:07:49,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:07:49,695 INFO L87 Difference]: Start difference. First operand 12441 states and 37169 transitions. Second operand 3 states. [2019-12-27 00:07:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:49,804 INFO L93 Difference]: Finished difference Result 14253 states and 42667 transitions. [2019-12-27 00:07:49,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:07:49,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 00:07:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:49,832 INFO L225 Difference]: With dead ends: 14253 [2019-12-27 00:07:49,832 INFO L226 Difference]: Without dead ends: 14253 [2019-12-27 00:07:49,832 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 00:07:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14253 states. [2019-12-27 00:07:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14253 to 11598. [2019-12-27 00:07:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11598 states. [2019-12-27 00:07:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11598 states to 11598 states and 34911 transitions. [2019-12-27 00:07:50,087 INFO L78 Accepts]: Start accepts. Automaton has 11598 states and 34911 transitions. Word has length 66 [2019-12-27 00:07:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:50,087 INFO L462 AbstractCegarLoop]: Abstraction has 11598 states and 34911 transitions. [2019-12-27 00:07:50,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:07:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 11598 states and 34911 transitions. [2019-12-27 00:07:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:07:50,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:50,099 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 00:07:50,099 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:50,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:50,100 INFO L82 PathProgramCache]: Analyzing trace with hash -881684233, now seen corresponding path program 1 times [2019-12-27 00:07:50,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:50,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256601569] [2019-12-27 00:07:50,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:50,195 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 00:07:50,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256601569] [2019-12-27 00:07:50,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:50,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:07:50,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024188267] [2019-12-27 00:07:50,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:07:50,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:50,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:07:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:07:50,199 INFO L87 Difference]: Start difference. First operand 11598 states and 34911 transitions. Second operand 7 states. [2019-12-27 00:07:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:50,955 INFO L93 Difference]: Finished difference Result 18745 states and 54912 transitions. [2019-12-27 00:07:50,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 00:07:50,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 00:07:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:50,980 INFO L225 Difference]: With dead ends: 18745 [2019-12-27 00:07:50,980 INFO L226 Difference]: Without dead ends: 18745 [2019-12-27 00:07:50,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:07:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18745 states. [2019-12-27 00:07:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18745 to 12654. [2019-12-27 00:07:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12654 states. [2019-12-27 00:07:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 37855 transitions. [2019-12-27 00:07:51,207 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 37855 transitions. Word has length 67 [2019-12-27 00:07:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:51,207 INFO L462 AbstractCegarLoop]: Abstraction has 12654 states and 37855 transitions. [2019-12-27 00:07:51,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:07:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 37855 transitions. [2019-12-27 00:07:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:07:51,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:51,220 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 00:07:51,220 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:51,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1394509299, now seen corresponding path program 2 times [2019-12-27 00:07:51,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:51,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970037001] [2019-12-27 00:07:51,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:51,285 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 00:07:51,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970037001] [2019-12-27 00:07:51,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:51,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:07:51,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856492324] [2019-12-27 00:07:51,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:07:51,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:51,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:07:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:07:51,287 INFO L87 Difference]: Start difference. First operand 12654 states and 37855 transitions. Second operand 4 states. [2019-12-27 00:07:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:51,386 INFO L93 Difference]: Finished difference Result 12522 states and 37296 transitions. [2019-12-27 00:07:51,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:07:51,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 00:07:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:51,402 INFO L225 Difference]: With dead ends: 12522 [2019-12-27 00:07:51,402 INFO L226 Difference]: Without dead ends: 12522 [2019-12-27 00:07:51,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:07:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12522 states. [2019-12-27 00:07:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12522 to 11586. [2019-12-27 00:07:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-27 00:07:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 34463 transitions. [2019-12-27 00:07:51,799 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 34463 transitions. Word has length 67 [2019-12-27 00:07:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:51,799 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 34463 transitions. [2019-12-27 00:07:51,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:07:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 34463 transitions. [2019-12-27 00:07:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:07:51,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:51,812 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 00:07:51,812 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 1 times [2019-12-27 00:07:51,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:51,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937322074] [2019-12-27 00:07:51,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:52,062 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 00:07:52,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937322074] [2019-12-27 00:07:52,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:52,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:07:52,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919208406] [2019-12-27 00:07:52,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:07:52,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:07:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:07:52,064 INFO L87 Difference]: Start difference. First operand 11586 states and 34463 transitions. Second operand 11 states. [2019-12-27 00:07:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:53,195 INFO L93 Difference]: Finished difference Result 19081 states and 56507 transitions. [2019-12-27 00:07:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 00:07:53,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 00:07:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:53,237 INFO L225 Difference]: With dead ends: 19081 [2019-12-27 00:07:53,237 INFO L226 Difference]: Without dead ends: 18062 [2019-12-27 00:07:53,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-27 00:07:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18062 states. [2019-12-27 00:07:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18062 to 16008. [2019-12-27 00:07:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16008 states. [2019-12-27 00:07:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16008 states to 16008 states and 47601 transitions. [2019-12-27 00:07:53,736 INFO L78 Accepts]: Start accepts. Automaton has 16008 states and 47601 transitions. Word has length 67 [2019-12-27 00:07:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:53,737 INFO L462 AbstractCegarLoop]: Abstraction has 16008 states and 47601 transitions. [2019-12-27 00:07:53,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:07:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 16008 states and 47601 transitions. [2019-12-27 00:07:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:07:53,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:53,762 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 00:07:53,762 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:53,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 289864222, now seen corresponding path program 2 times [2019-12-27 00:07:53,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:53,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029983866] [2019-12-27 00:07:53,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:54,426 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 00:07:54,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029983866] [2019-12-27 00:07:54,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:54,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 00:07:54,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778548249] [2019-12-27 00:07:54,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 00:07:54,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:54,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 00:07:54,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-27 00:07:54,429 INFO L87 Difference]: Start difference. First operand 16008 states and 47601 transitions. Second operand 18 states. [2019-12-27 00:07:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:56,222 INFO L93 Difference]: Finished difference Result 17235 states and 50511 transitions. [2019-12-27 00:07:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 00:07:56,222 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 00:07:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:56,246 INFO L225 Difference]: With dead ends: 17235 [2019-12-27 00:07:56,246 INFO L226 Difference]: Without dead ends: 16992 [2019-12-27 00:07:56,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:07:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16992 states. [2019-12-27 00:07:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16992 to 15334. [2019-12-27 00:07:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15334 states. [2019-12-27 00:07:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15334 states to 15334 states and 45266 transitions. [2019-12-27 00:07:56,468 INFO L78 Accepts]: Start accepts. Automaton has 15334 states and 45266 transitions. Word has length 67 [2019-12-27 00:07:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:07:56,468 INFO L462 AbstractCegarLoop]: Abstraction has 15334 states and 45266 transitions. [2019-12-27 00:07:56,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 00:07:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 15334 states and 45266 transitions. [2019-12-27 00:07:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:07:56,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:07:56,482 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 00:07:56,482 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:07:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:07:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1549293754, now seen corresponding path program 3 times [2019-12-27 00:07:56,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:07:56,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606905192] [2019-12-27 00:07:56,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:07:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:07:57,188 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 14 [2019-12-27 00:07:57,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 00:07:57,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606905192] [2019-12-27 00:07:57,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:07:57,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 00:07:57,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494959628] [2019-12-27 00:07:57,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 00:07:57,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:07:57,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 00:07:57,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:07:57,320 INFO L87 Difference]: Start difference. First operand 15334 states and 45266 transitions. Second operand 19 states. [2019-12-27 00:07:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:07:59,833 INFO L93 Difference]: Finished difference Result 20642 states and 60690 transitions. [2019-12-27 00:07:59,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 00:07:59,834 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 00:07:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:07:59,860 INFO L225 Difference]: With dead ends: 20642 [2019-12-27 00:07:59,860 INFO L226 Difference]: Without dead ends: 20415 [2019-12-27 00:07:59,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 00:07:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20415 states. [2019-12-27 00:08:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20415 to 16450. [2019-12-27 00:08:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16450 states. [2019-12-27 00:08:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16450 states to 16450 states and 48579 transitions. [2019-12-27 00:08:00,111 INFO L78 Accepts]: Start accepts. Automaton has 16450 states and 48579 transitions. Word has length 67 [2019-12-27 00:08:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:08:00,112 INFO L462 AbstractCegarLoop]: Abstraction has 16450 states and 48579 transitions. [2019-12-27 00:08:00,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 00:08:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 16450 states and 48579 transitions. [2019-12-27 00:08:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:08:00,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:08:00,128 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 00:08:00,128 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:08:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:08:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1095470650, now seen corresponding path program 4 times [2019-12-27 00:08:00,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:08:00,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863242128] [2019-12-27 00:08:00,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:08:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:08:00,294 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 00:08:00,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863242128] [2019-12-27 00:08:00,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:08:00,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:08:00,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368272563] [2019-12-27 00:08:00,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:08:00,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:08:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:08:00,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:08:00,296 INFO L87 Difference]: Start difference. First operand 16450 states and 48579 transitions. Second operand 11 states. [2019-12-27 00:08:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:08:01,022 INFO L93 Difference]: Finished difference Result 19056 states and 55364 transitions. [2019-12-27 00:08:01,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 00:08:01,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 00:08:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:08:01,040 INFO L225 Difference]: With dead ends: 19056 [2019-12-27 00:08:01,040 INFO L226 Difference]: Without dead ends: 13764 [2019-12-27 00:08:01,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 00:08:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13764 states. [2019-12-27 00:08:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13764 to 11303. [2019-12-27 00:08:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11303 states. [2019-12-27 00:08:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11303 states to 11303 states and 32857 transitions. [2019-12-27 00:08:01,208 INFO L78 Accepts]: Start accepts. Automaton has 11303 states and 32857 transitions. Word has length 67 [2019-12-27 00:08:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:08:01,209 INFO L462 AbstractCegarLoop]: Abstraction has 11303 states and 32857 transitions. [2019-12-27 00:08:01,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:08:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 11303 states and 32857 transitions. [2019-12-27 00:08:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:08:01,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:08:01,220 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 00:08:01,220 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:08:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:08:01,221 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 5 times [2019-12-27 00:08:01,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:08:01,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720631968] [2019-12-27 00:08:01,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:08:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:08:01,788 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 00:08:01,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720631968] [2019-12-27 00:08:01,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:08:01,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 00:08:01,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131491413] [2019-12-27 00:08:01,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 00:08:01,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:08:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 00:08:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-12-27 00:08:01,791 INFO L87 Difference]: Start difference. First operand 11303 states and 32857 transitions. Second operand 21 states. [2019-12-27 00:08:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:08:04,726 INFO L93 Difference]: Finished difference Result 13234 states and 37394 transitions. [2019-12-27 00:08:04,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 00:08:04,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 00:08:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:08:04,744 INFO L225 Difference]: With dead ends: 13234 [2019-12-27 00:08:04,744 INFO L226 Difference]: Without dead ends: 12155 [2019-12-27 00:08:04,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 00:08:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12155 states. [2019-12-27 00:08:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12155 to 11309. [2019-12-27 00:08:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11309 states. [2019-12-27 00:08:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11309 states to 11309 states and 32854 transitions. [2019-12-27 00:08:04,911 INFO L78 Accepts]: Start accepts. Automaton has 11309 states and 32854 transitions. Word has length 67 [2019-12-27 00:08:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:08:04,911 INFO L462 AbstractCegarLoop]: Abstraction has 11309 states and 32854 transitions. [2019-12-27 00:08:04,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 00:08:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 11309 states and 32854 transitions. [2019-12-27 00:08:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:08:04,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:08:04,922 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 00:08:04,922 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:08:04,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:08:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash 289428518, now seen corresponding path program 6 times [2019-12-27 00:08:04,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:08:04,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465807987] [2019-12-27 00:08:04,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:08:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:08:05,531 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 00:08:05,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465807987] [2019-12-27 00:08:05,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:08:05,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 00:08:05,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77117254] [2019-12-27 00:08:05,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 00:08:05,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:08:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 00:08:05,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:08:05,534 INFO L87 Difference]: Start difference. First operand 11309 states and 32854 transitions. Second operand 22 states. [2019-12-27 00:08:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:08:08,427 INFO L93 Difference]: Finished difference Result 13216 states and 37346 transitions. [2019-12-27 00:08:08,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 00:08:08,428 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 00:08:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:08:08,444 INFO L225 Difference]: With dead ends: 13216 [2019-12-27 00:08:08,444 INFO L226 Difference]: Without dead ends: 12149 [2019-12-27 00:08:08,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=258, Invalid=1812, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 00:08:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2019-12-27 00:08:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11309. [2019-12-27 00:08:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11309 states. [2019-12-27 00:08:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11309 states to 11309 states and 32764 transitions. [2019-12-27 00:08:08,605 INFO L78 Accepts]: Start accepts. Automaton has 11309 states and 32764 transitions. Word has length 67 [2019-12-27 00:08:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:08:08,605 INFO L462 AbstractCegarLoop]: Abstraction has 11309 states and 32764 transitions. [2019-12-27 00:08:08,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 00:08:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 11309 states and 32764 transitions. [2019-12-27 00:08:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:08:08,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:08:08,617 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 00:08:08,617 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:08:08,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:08:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2063277766, now seen corresponding path program 7 times [2019-12-27 00:08:08,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:08:08,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747491823] [2019-12-27 00:08:08,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:08:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:08:08,770 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 00:08:08,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747491823] [2019-12-27 00:08:08,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:08:08,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:08:08,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422919173] [2019-12-27 00:08:08,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:08:08,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:08:08,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:08:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:08:08,772 INFO L87 Difference]: Start difference. First operand 11309 states and 32764 transitions. Second operand 11 states. Received shutdown request... [2019-12-27 00:08:09,321 WARN L209 SmtUtils]: Removed 4 from assertion stack [2019-12-27 00:08:09,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:08:09,321 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 00:08:09,327 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 00:08:09,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:08:09 BasicIcfg [2019-12-27 00:08:09,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:08:09,332 INFO L168 Benchmark]: Toolchain (without parser) took 192596.46 ms. Allocated memory was 140.5 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 97.0 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 00:08:09,332 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 116.8 MB in the beginning and 116.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 00:08:09,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.15 ms. Allocated memory was 140.5 MB in the beginning and 198.2 MB in the end (delta: 57.7 MB). Free memory was 96.6 MB in the beginning and 151.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 00:08:09,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.74 ms. Allocated memory is still 198.2 MB. Free memory was 151.4 MB in the beginning and 148.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:08:09,333 INFO L168 Benchmark]: Boogie Preprocessor took 76.85 ms. Allocated memory is still 198.2 MB. Free memory was 148.3 MB in the beginning and 146.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:08:09,334 INFO L168 Benchmark]: RCFGBuilder took 810.82 ms. Allocated memory is still 198.2 MB. Free memory was 146.1 MB in the beginning and 96.1 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:08:09,334 INFO L168 Benchmark]: TraceAbstraction took 190844.91 ms. Allocated memory was 198.2 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 95.4 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 00:08:09,337 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.21 ms. Allocated memory is still 140.5 MB. Free memory was 116.8 MB in the beginning and 116.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.15 ms. Allocated memory was 140.5 MB in the beginning and 198.2 MB in the end (delta: 57.7 MB). Free memory was 96.6 MB in the beginning and 151.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.74 ms. Allocated memory is still 198.2 MB. Free memory was 151.4 MB in the beginning and 148.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.85 ms. Allocated memory is still 198.2 MB. Free memory was 148.3 MB in the beginning and 146.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.82 ms. Allocated memory is still 198.2 MB. Free memory was 146.1 MB in the beginning and 96.1 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190844.91 ms. Allocated memory was 198.2 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 95.4 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (11309states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 6ms.. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (11309states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 6ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: TIMEOUT, OverallTime: 190.6s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 63.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5838 SDtfs, 8561 SDslu, 21883 SDs, 0 SdLazy, 14320 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 50 SyntacticMatches, 21 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206903occurred 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: 98.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 184749 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1356 NumberOfCodeBlocks, 1356 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 418305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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 could not prove your program: Timeout Completed graceful shutdown