/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:41:08,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:41:08,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:41:08,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:41:08,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:41:08,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:41:08,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:41:08,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:41:08,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:41:08,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:41:08,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:41:08,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:41:08,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:41:08,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:41:08,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:41:08,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:41:08,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:41:08,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:41:08,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:41:08,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:41:08,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:41:08,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:41:08,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:41:08,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:41:08,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:41:08,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:41:08,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:41:08,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:41:08,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:41:08,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:41:08,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:41:08,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:41:08,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:41:08,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:41:08,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:41:08,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:41:08,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:41:08,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:41:08,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:41:08,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:41:08,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:41:08,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:41:08,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:41:08,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:41:08,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:41:08,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:41:08,479 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:41:08,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:41:08,480 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:41:08,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:41:08,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:41:08,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:41:08,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:41:08,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:41:08,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:41:08,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:41:08,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:41:08,483 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:41:08,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:41:08,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:41:08,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:41:08,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:41:08,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:41:08,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:41:08,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:41:08,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:41:08,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:41:08,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:41:08,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:41:08,485 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:41:08,485 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:41:08,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:41:08,486 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:41:08,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:41:08,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:41:08,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:41:08,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:41:08,789 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:41:08,789 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:41:08,790 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2019-12-27 22:41:08,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/386d0d158/9262f9256d7f4cf0b3edbb82357822cd/FLAG42a66f81a [2019-12-27 22:41:09,443 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:41:09,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2019-12-27 22:41:09,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/386d0d158/9262f9256d7f4cf0b3edbb82357822cd/FLAG42a66f81a [2019-12-27 22:41:09,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/386d0d158/9262f9256d7f4cf0b3edbb82357822cd [2019-12-27 22:41:09,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:41:09,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:41:09,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:41:09,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:41:09,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:41:09,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:41:09" (1/1) ... [2019-12-27 22:41:09,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:09, skipping insertion in model container [2019-12-27 22:41:09,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:41:09" (1/1) ... [2019-12-27 22:41:09,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:41:09,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:41:10,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:41:10,291 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:41:10,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:41:10,461 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:41:10,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10 WrapperNode [2019-12-27 22:41:10,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:41:10,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:41:10,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:41:10,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:41:10,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (1/1) ... [2019-12-27 22:41:10,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (1/1) ... [2019-12-27 22:41:10,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:41:10,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:41:10,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:41:10,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:41:10,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (1/1) ... [2019-12-27 22:41:10,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (1/1) ... [2019-12-27 22:41:10,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (1/1) ... [2019-12-27 22:41:10,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (1/1) ... [2019-12-27 22:41:10,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (1/1) ... [2019-12-27 22:41:10,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (1/1) ... [2019-12-27 22:41:10,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (1/1) ... [2019-12-27 22:41:10,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:41:10,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:41:10,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:41:10,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:41:10,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (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 22:41:10,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:41:10,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:41:10,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:41:10,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:41:10,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:41:10,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:41:10,635 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:41:10,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:41:10,636 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:41:10,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:41:10,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:41:10,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:41:10,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:41:10,638 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 22:41:11,416 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:41:11,416 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:41:11,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:41:11 BoogieIcfgContainer [2019-12-27 22:41:11,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:41:11,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:41:11,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:41:11,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:41:11,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:41:09" (1/3) ... [2019-12-27 22:41:11,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72184c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:41:11, skipping insertion in model container [2019-12-27 22:41:11,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:41:10" (2/3) ... [2019-12-27 22:41:11,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72184c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:41:11, skipping insertion in model container [2019-12-27 22:41:11,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:41:11" (3/3) ... [2019-12-27 22:41:11,427 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_rmo.opt.i [2019-12-27 22:41:11,438 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:41:11,438 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:41:11,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:41:11,447 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:41:11,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,491 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,491 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,492 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,492 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,500 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,500 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,564 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,573 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,575 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:41:11,595 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:41:11,618 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:41:11,619 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:41:11,619 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:41:11,619 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:41:11,619 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:41:11,619 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:41:11,619 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:41:11,620 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:41:11,645 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 22:41:11,647 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:41:11,750 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:41:11,750 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:41:11,766 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:41:11,791 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:41:11,845 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:41:11,846 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:41:11,854 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:41:11,875 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 22:41:11,876 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:41:15,594 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:41:15,728 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:41:15,756 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 22:41:15,756 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 22:41:15,760 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 22:41:31,649 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 22:41:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 22:41:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:41:31,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:31,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:41:31,657 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 22:41:31,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 22:41:31,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:31,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470038432] [2019-12-27 22:41:31,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:41:31,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470038432] [2019-12-27 22:41:31,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:31,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:41:31,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111481070] [2019-12-27 22:41:31,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:32,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:32,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:41:32,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:32,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:32,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:41:32,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:32,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:41:32,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:32,065 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 22:41:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:33,495 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 22:41:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:41:33,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:41:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:36,929 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 22:41:36,929 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 22:41:36,930 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 22:41:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 22:41:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 22:41:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 22:41:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 22:41:47,432 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 22:41:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:47,432 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 22:41:47,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:41:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 22:41:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:41:47,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:47,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:47,438 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 22:41:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 22:41:47,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:47,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340696199] [2019-12-27 22:41:47,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:47,590 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 22:41:47,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340696199] [2019-12-27 22:41:47,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:47,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:41:47,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [532816845] [2019-12-27 22:41:47,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:47,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:47,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:41:47,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:47,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:47,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:41:47,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:47,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:41:47,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:41:47,599 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 22:41:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:52,774 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 22:41:52,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:41:52,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:41:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:53,255 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 22:41:53,255 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 22:41:53,256 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 22:41:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 22:42:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 22:42:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 22:42:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 22:42:01,862 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 22:42:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:01,862 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 22:42:01,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:42:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 22:42:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:42:01,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:01,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:01,869 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 22:42:01,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 22:42:01,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:01,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012426460] [2019-12-27 22:42:01,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:01,947 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 22:42:01,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012426460] [2019-12-27 22:42:01,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:01,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:01,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [133387708] [2019-12-27 22:42:01,948 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:01,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:01,951 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:42:01,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:01,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:01,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:01,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:01,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:01,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:01,953 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 22:42:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:02,092 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 22:42:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:02,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:42:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:02,194 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 22:42:02,195 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 22:42:02,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:42:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 22:42:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 22:42:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 22:42:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 22:42:07,205 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 22:42:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:07,206 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 22:42:07,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 22:42:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 22:42:07,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:07,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:07,209 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 22:42:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:07,209 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 22:42:07,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:07,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999793130] [2019-12-27 22:42:07,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:07,381 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 22:42:07,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999793130] [2019-12-27 22:42:07,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:07,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:42:07,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123213611] [2019-12-27 22:42:07,382 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:07,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:07,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 22:42:07,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:07,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:07,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:42:07,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:42:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:07,391 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 22:42:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:07,925 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 22:42:07,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:42:07,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 22:42:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:08,083 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 22:42:08,083 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 22:42:08,084 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 22:42:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 22:42:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 22:42:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 22:42:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 22:42:09,172 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 22:42:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:09,173 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 22:42:09,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:42:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 22:42:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:42:09,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:09,185 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 22:42:09,185 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 22:42:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 22:42:09,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:09,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138292971] [2019-12-27 22:42:09,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:09,295 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 22:42:09,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138292971] [2019-12-27 22:42:09,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:09,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:42:09,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2078959279] [2019-12-27 22:42:09,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:09,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:09,308 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 22:42:09,308 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:09,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:09,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:42:09,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:42:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:42:09,311 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 22:42:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:10,440 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 22:42:10,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:42:10,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:42:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:10,573 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 22:42:10,573 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 22:42:10,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:42:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 22:42:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 22:42:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 22:42:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 22:42:11,813 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 22:42:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:11,814 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 22:42:11,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:42:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 22:42:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:42:11,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:11,832 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 22:42:11,833 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 22:42:11,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:11,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 22:42:11,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:11,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094749134] [2019-12-27 22:42:11,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:11,918 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 22:42:11,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094749134] [2019-12-27 22:42:11,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:11,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:42:11,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902352390] [2019-12-27 22:42:11,919 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:11,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:11,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 22:42:11,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:11,985 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:42:11,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:42:11,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:42:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:11,987 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 5 states. [2019-12-27 22:42:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:12,059 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 22:42:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:42:12,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:42:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:12,084 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 22:42:12,084 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 22:42:12,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 22:42:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 22:42:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 22:42:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 22:42:12,321 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 22:42:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:12,322 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 22:42:12,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:42:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 22:42:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 22:42:12,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:12,338 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 22:42:12,338 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 22:42:12,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:12,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 22:42:12,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:12,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275773115] [2019-12-27 22:42:12,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:12,457 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 22:42:12,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275773115] [2019-12-27 22:42:12,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:12,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:42:12,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409974198] [2019-12-27 22:42:12,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:12,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:12,476 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 22:42:12,477 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:12,477 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:12,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:42:12,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:42:12,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:42:12,478 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 22:42:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:13,081 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 22:42:13,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:42:13,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 22:42:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:13,124 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 22:42:13,124 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 22:42:13,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:42:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 22:42:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 22:42:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 22:42:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 22:42:13,437 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 22:42:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:13,437 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 22:42:13,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:42:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 22:42:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 22:42:13,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:13,456 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 22:42:13,456 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 22:42:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:13,456 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 22:42:13,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:13,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189926911] [2019-12-27 22:42:13,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:13,619 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 22:42:13,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189926911] [2019-12-27 22:42:13,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:13,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:42:13,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568498747] [2019-12-27 22:42:13,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:13,629 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:13,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 22:42:13,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:13,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:13,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:42:13,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:13,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:42:13,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:42:13,653 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-27 22:42:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:15,143 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-27 22:42:15,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:42:15,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 22:42:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:15,179 INFO L225 Difference]: With dead ends: 24877 [2019-12-27 22:42:15,179 INFO L226 Difference]: Without dead ends: 24877 [2019-12-27 22:42:15,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:42:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-27 22:42:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-27 22:42:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 22:42:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 22:42:15,477 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 22:42:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:15,477 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 22:42:15,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:42:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 22:42:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:42:15,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:15,508 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] [2019-12-27 22:42:15,508 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 22:42:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 22:42:15,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:15,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221455801] [2019-12-27 22:42:15,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:15,571 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 22:42:15,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221455801] [2019-12-27 22:42:15,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:15,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:42:15,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1974394487] [2019-12-27 22:42:15,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:15,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:15,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 22:42:15,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:15,655 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:15,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:15,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:15,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:15,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:15,656 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 3 states. [2019-12-27 22:42:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:15,739 INFO L93 Difference]: Finished difference Result 16953 states and 50980 transitions. [2019-12-27 22:42:15,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:15,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 22:42:15,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:15,776 INFO L225 Difference]: With dead ends: 16953 [2019-12-27 22:42:15,777 INFO L226 Difference]: Without dead ends: 16953 [2019-12-27 22:42:15,777 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 22:42:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2019-12-27 22:42:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16953. [2019-12-27 22:42:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16953 states. [2019-12-27 22:42:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16953 states to 16953 states and 50980 transitions. [2019-12-27 22:42:16,177 INFO L78 Accepts]: Start accepts. Automaton has 16953 states and 50980 transitions. Word has length 39 [2019-12-27 22:42:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:16,177 INFO L462 AbstractCegarLoop]: Abstraction has 16953 states and 50980 transitions. [2019-12-27 22:42:16,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 16953 states and 50980 transitions. [2019-12-27 22:42:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:42:16,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:16,209 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 22:42:16,209 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 22:42:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1842516343, now seen corresponding path program 1 times [2019-12-27 22:42:16,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:16,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181713094] [2019-12-27 22:42:16,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:16,307 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 22:42:16,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181713094] [2019-12-27 22:42:16,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:16,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:16,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889928156] [2019-12-27 22:42:16,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:16,317 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:16,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 198 transitions. [2019-12-27 22:42:16,361 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:16,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:42:16,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:42:16,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:16,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:42:16,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:42:16,386 INFO L87 Difference]: Start difference. First operand 16953 states and 50980 transitions. Second operand 4 states. [2019-12-27 22:42:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:16,492 INFO L93 Difference]: Finished difference Result 32065 states and 96487 transitions. [2019-12-27 22:42:16,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:42:16,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 22:42:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:16,518 INFO L225 Difference]: With dead ends: 32065 [2019-12-27 22:42:16,518 INFO L226 Difference]: Without dead ends: 16605 [2019-12-27 22:42:16,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 4 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 22:42:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2019-12-27 22:42:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16603. [2019-12-27 22:42:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16603 states. [2019-12-27 22:42:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16603 states to 16603 states and 49251 transitions. [2019-12-27 22:42:16,985 INFO L78 Accepts]: Start accepts. Automaton has 16603 states and 49251 transitions. Word has length 40 [2019-12-27 22:42:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:16,985 INFO L462 AbstractCegarLoop]: Abstraction has 16603 states and 49251 transitions. [2019-12-27 22:42:16,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:42:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 16603 states and 49251 transitions. [2019-12-27 22:42:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:42:17,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:17,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:17,004 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 22:42:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash 559678541, now seen corresponding path program 2 times [2019-12-27 22:42:17,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:17,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416294590] [2019-12-27 22:42:17,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:17,089 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 22:42:17,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416294590] [2019-12-27 22:42:17,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:17,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:42:17,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1740078075] [2019-12-27 22:42:17,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:17,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:17,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 324 transitions. [2019-12-27 22:42:17,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:17,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:42:17,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:42:17,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:17,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:42:17,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:42:17,394 INFO L87 Difference]: Start difference. First operand 16603 states and 49251 transitions. Second operand 11 states. [2019-12-27 22:42:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:18,689 INFO L93 Difference]: Finished difference Result 22916 states and 67717 transitions. [2019-12-27 22:42:18,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:42:18,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-27 22:42:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:18,722 INFO L225 Difference]: With dead ends: 22916 [2019-12-27 22:42:18,722 INFO L226 Difference]: Without dead ends: 22916 [2019-12-27 22:42:18,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:42:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22916 states. [2019-12-27 22:42:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22916 to 21410. [2019-12-27 22:42:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-27 22:42:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 63610 transitions. [2019-12-27 22:42:19,050 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 63610 transitions. Word has length 40 [2019-12-27 22:42:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:19,050 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 63610 transitions. [2019-12-27 22:42:19,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:42:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 63610 transitions. [2019-12-27 22:42:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:42:19,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:19,069 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 22:42:19,070 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 22:42:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash 698759109, now seen corresponding path program 3 times [2019-12-27 22:42:19,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:19,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928276963] [2019-12-27 22:42:19,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:19,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928276963] [2019-12-27 22:42:19,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:19,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:42:19,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [217985046] [2019-12-27 22:42:19,141 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:19,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:19,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 450 transitions. [2019-12-27 22:42:19,242 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:19,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:42:19,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:42:19,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:19,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:42:19,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:42:19,292 INFO L87 Difference]: Start difference. First operand 21410 states and 63610 transitions. Second operand 7 states. [2019-12-27 22:42:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:19,390 INFO L93 Difference]: Finished difference Result 20165 states and 60739 transitions. [2019-12-27 22:42:19,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:42:19,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 22:42:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:19,417 INFO L225 Difference]: With dead ends: 20165 [2019-12-27 22:42:19,417 INFO L226 Difference]: Without dead ends: 19671 [2019-12-27 22:42:19,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:42:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2019-12-27 22:42:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 18831. [2019-12-27 22:42:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18831 states. [2019-12-27 22:42:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 57508 transitions. [2019-12-27 22:42:19,931 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 57508 transitions. Word has length 40 [2019-12-27 22:42:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:19,931 INFO L462 AbstractCegarLoop]: Abstraction has 18831 states and 57508 transitions. [2019-12-27 22:42:19,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:42:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 57508 transitions. [2019-12-27 22:42:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:42:19,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:19,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:19,953 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 22:42:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash -19391093, now seen corresponding path program 1 times [2019-12-27 22:42:19,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:19,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89093648] [2019-12-27 22:42:19,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:20,009 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 22:42:20,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89093648] [2019-12-27 22:42:20,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:20,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:42:20,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019446273] [2019-12-27 22:42:20,010 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:20,031 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:20,218 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 22:42:20,218 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:20,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:42:20,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:20,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:20,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:20,234 INFO L87 Difference]: Start difference. First operand 18831 states and 57508 transitions. Second operand 3 states. [2019-12-27 22:42:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:20,337 INFO L93 Difference]: Finished difference Result 27792 states and 85045 transitions. [2019-12-27 22:42:20,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:20,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 22:42:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:20,374 INFO L225 Difference]: With dead ends: 27792 [2019-12-27 22:42:20,375 INFO L226 Difference]: Without dead ends: 27792 [2019-12-27 22:42:20,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27792 states. [2019-12-27 22:42:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27792 to 21217. [2019-12-27 22:42:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 22:42:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 22:42:20,776 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 22:42:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:20,776 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 22:42:20,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 22:42:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:42:20,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:20,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:20,814 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 22:42:20,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 1 times [2019-12-27 22:42:20,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:20,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891177491] [2019-12-27 22:42:20,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:20,906 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 22:42:20,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891177491] [2019-12-27 22:42:20,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:20,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:42:20,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1110599108] [2019-12-27 22:42:20,908 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:20,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:21,349 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 22:42:21,349 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:21,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:42:21,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:42:21,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:42:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:42:21,471 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 11 states. [2019-12-27 22:42:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:22,218 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 22:42:22,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:42:22,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 22:42:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:22,283 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 22:42:22,284 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 22:42:22,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:42:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 22:42:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 22:42:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 22:42:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 22:42:22,801 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 22:42:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:22,801 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 22:42:22,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:42:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 22:42:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:42:22,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:22,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:22,830 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 22:42:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 2 times [2019-12-27 22:42:22,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:22,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553997677] [2019-12-27 22:42:22,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:22,929 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 22:42:22,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553997677] [2019-12-27 22:42:22,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:22,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:42:22,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084435683] [2019-12-27 22:42:22,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:22,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:23,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 467 transitions. [2019-12-27 22:42:23,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:23,568 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 22:42:23,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:42:23,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:23,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:42:23,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:42:23,570 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 10 states. [2019-12-27 22:42:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:25,066 INFO L93 Difference]: Finished difference Result 132353 states and 401673 transitions. [2019-12-27 22:42:25,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 22:42:25,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 22:42:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:25,226 INFO L225 Difference]: With dead ends: 132353 [2019-12-27 22:42:25,226 INFO L226 Difference]: Without dead ends: 102599 [2019-12-27 22:42:25,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 22:42:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102599 states. [2019-12-27 22:42:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102599 to 28331. [2019-12-27 22:42:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 22:42:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 22:42:26,702 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 22:42:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:26,702 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 22:42:26,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:42:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 22:42:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:42:26,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:26,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:26,735 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 22:42:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:26,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 3 times [2019-12-27 22:42:26,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:26,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240802471] [2019-12-27 22:42:26,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:26,830 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 22:42:26,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240802471] [2019-12-27 22:42:26,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:26,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:42:26,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [646657251] [2019-12-27 22:42:26,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:26,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:27,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 22:42:27,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:27,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:42:27,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:42:27,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:27,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:42:27,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:42:27,225 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 11 states. [2019-12-27 22:42:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:28,984 INFO L93 Difference]: Finished difference Result 81245 states and 247982 transitions. [2019-12-27 22:42:28,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:42:28,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 22:42:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:29,095 INFO L225 Difference]: With dead ends: 81245 [2019-12-27 22:42:29,095 INFO L226 Difference]: Without dead ends: 71796 [2019-12-27 22:42:29,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:42:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71796 states. [2019-12-27 22:42:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71796 to 28639. [2019-12-27 22:42:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 22:42:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 22:42:30,268 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 22:42:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:30,268 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 22:42:30,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:42:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 22:42:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:42:30,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:30,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:30,304 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 22:42:30,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:30,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 4 times [2019-12-27 22:42:30,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:30,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095908224] [2019-12-27 22:42:30,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:30,372 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 22:42:30,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095908224] [2019-12-27 22:42:30,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:30,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:30,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [169191320] [2019-12-27 22:42:30,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:30,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:30,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 307 transitions. [2019-12-27 22:42:30,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:30,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:30,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:30,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:30,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:30,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:30,652 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 22:42:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:30,894 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 22:42:30,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:30,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 22:42:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:30,968 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 22:42:30,968 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 22:42:30,969 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 22:42:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 22:42:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 22:42:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 22:42:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 22:42:31,564 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 22:42:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:31,564 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 22:42:31,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 22:42:31,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:42:31,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:31,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:31,860 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 22:42:31,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:31,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 22:42:31,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:31,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699817584] [2019-12-27 22:42:31,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:31,915 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 22:42:31,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699817584] [2019-12-27 22:42:31,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:31,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:42:31,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1121414721] [2019-12-27 22:42:31,916 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:31,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:32,208 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 22:42:32,209 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:32,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:42:32,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:42:32,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:32,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:42:32,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:42:32,275 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 6 states. [2019-12-27 22:42:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:32,960 INFO L93 Difference]: Finished difference Result 54266 states and 168301 transitions. [2019-12-27 22:42:32,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:42:32,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 22:42:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:33,040 INFO L225 Difference]: With dead ends: 54266 [2019-12-27 22:42:33,040 INFO L226 Difference]: Without dead ends: 54266 [2019-12-27 22:42:33,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:42:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54266 states. [2019-12-27 22:42:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54266 to 31050. [2019-12-27 22:42:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31050 states. [2019-12-27 22:42:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31050 states to 31050 states and 96522 transitions. [2019-12-27 22:42:33,742 INFO L78 Accepts]: Start accepts. Automaton has 31050 states and 96522 transitions. Word has length 65 [2019-12-27 22:42:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:33,743 INFO L462 AbstractCegarLoop]: Abstraction has 31050 states and 96522 transitions. [2019-12-27 22:42:33,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:42:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 31050 states and 96522 transitions. [2019-12-27 22:42:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:42:33,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:33,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:33,778 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 22:42:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 2 times [2019-12-27 22:42:33,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:33,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393726022] [2019-12-27 22:42:33,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:33,869 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 22:42:33,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393726022] [2019-12-27 22:42:33,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:33,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:42:33,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1483842326] [2019-12-27 22:42:33,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:34,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:34,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 497 transitions. [2019-12-27 22:42:34,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:34,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:42:34,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:42:34,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:42:34,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:42:34,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:34,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:42:34,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:42:34,890 INFO L87 Difference]: Start difference. First operand 31050 states and 96522 transitions. Second operand 12 states. [2019-12-27 22:42:36,253 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-27 22:42:37,828 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 22:42:38,000 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 22:42:38,808 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 22:42:40,908 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-27 22:42:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:42,074 INFO L93 Difference]: Finished difference Result 145008 states and 441349 transitions. [2019-12-27 22:42:42,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 22:42:42,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 22:42:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:42,267 INFO L225 Difference]: With dead ends: 145008 [2019-12-27 22:42:42,267 INFO L226 Difference]: Without dead ends: 119327 [2019-12-27 22:42:42,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=784, Invalid=3376, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 22:42:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119327 states. [2019-12-27 22:42:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119327 to 31635. [2019-12-27 22:42:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-12-27 22:42:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 98776 transitions. [2019-12-27 22:42:43,441 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 98776 transitions. Word has length 65 [2019-12-27 22:42:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:43,441 INFO L462 AbstractCegarLoop]: Abstraction has 31635 states and 98776 transitions. [2019-12-27 22:42:43,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:42:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 98776 transitions. [2019-12-27 22:42:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:42:43,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:43,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:43,478 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 22:42:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 22:42:43,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:43,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544689851] [2019-12-27 22:42:43,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:43,550 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 22:42:43,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544689851] [2019-12-27 22:42:43,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:43,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:42:43,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [536273571] [2019-12-27 22:42:43,551 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:43,571 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:44,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 273 transitions. [2019-12-27 22:42:44,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:44,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:42:44,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:42:44,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:44,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:42:44,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:44,046 INFO L87 Difference]: Start difference. First operand 31635 states and 98776 transitions. Second operand 5 states. [2019-12-27 22:42:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:44,695 INFO L93 Difference]: Finished difference Result 48003 states and 146796 transitions. [2019-12-27 22:42:44,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:42:44,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:42:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:44,766 INFO L225 Difference]: With dead ends: 48003 [2019-12-27 22:42:44,766 INFO L226 Difference]: Without dead ends: 47783 [2019-12-27 22:42:44,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 8 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 22:42:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47783 states. [2019-12-27 22:42:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47783 to 37821. [2019-12-27 22:42:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37821 states. [2019-12-27 22:42:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37821 states to 37821 states and 117767 transitions. [2019-12-27 22:42:45,417 INFO L78 Accepts]: Start accepts. Automaton has 37821 states and 117767 transitions. Word has length 65 [2019-12-27 22:42:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:45,417 INFO L462 AbstractCegarLoop]: Abstraction has 37821 states and 117767 transitions. [2019-12-27 22:42:45,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:42:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 37821 states and 117767 transitions. [2019-12-27 22:42:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:42:45,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:45,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:45,460 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 22:42:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:45,461 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 22:42:45,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:45,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640303163] [2019-12-27 22:42:45,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:45,610 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 22:42:45,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640303163] [2019-12-27 22:42:45,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:45,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:42:45,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314918275] [2019-12-27 22:42:45,611 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:45,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:45,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 304 transitions. [2019-12-27 22:42:45,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:45,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:42:45,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:42:45,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:42:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:42:45,960 INFO L87 Difference]: Start difference. First operand 37821 states and 117767 transitions. Second operand 13 states. [2019-12-27 22:42:48,204 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-12-27 22:42:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:49,069 INFO L93 Difference]: Finished difference Result 72164 states and 220001 transitions. [2019-12-27 22:42:49,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 22:42:49,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 22:42:49,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:49,180 INFO L225 Difference]: With dead ends: 72164 [2019-12-27 22:42:49,180 INFO L226 Difference]: Without dead ends: 72038 [2019-12-27 22:42:49,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:42:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72038 states. [2019-12-27 22:42:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72038 to 40078. [2019-12-27 22:42:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40078 states. [2019-12-27 22:42:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40078 states to 40078 states and 124479 transitions. [2019-12-27 22:42:50,079 INFO L78 Accepts]: Start accepts. Automaton has 40078 states and 124479 transitions. Word has length 65 [2019-12-27 22:42:50,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:50,079 INFO L462 AbstractCegarLoop]: Abstraction has 40078 states and 124479 transitions. [2019-12-27 22:42:50,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:42:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 40078 states and 124479 transitions. [2019-12-27 22:42:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:42:50,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:50,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:50,140 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 22:42:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 22:42:50,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:50,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307681631] [2019-12-27 22:42:50,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:50,299 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 22:42:50,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307681631] [2019-12-27 22:42:50,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:50,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:42:50,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [819919769] [2019-12-27 22:42:50,300 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:50,318 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:50,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 248 transitions. [2019-12-27 22:42:50,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:50,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:42:50,733 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:42:50,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:42:50,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:50,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:42:50,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:42:50,734 INFO L87 Difference]: Start difference. First operand 40078 states and 124479 transitions. Second operand 15 states. [2019-12-27 22:42:53,205 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-12-27 22:42:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:56,905 INFO L93 Difference]: Finished difference Result 72344 states and 219755 transitions. [2019-12-27 22:42:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 22:42:56,906 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-27 22:42:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:57,016 INFO L225 Difference]: With dead ends: 72344 [2019-12-27 22:42:57,016 INFO L226 Difference]: Without dead ends: 72048 [2019-12-27 22:42:57,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=631, Invalid=3029, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 22:42:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72048 states. [2019-12-27 22:42:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72048 to 41610. [2019-12-27 22:42:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41610 states. [2019-12-27 22:42:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41610 states to 41610 states and 128853 transitions. [2019-12-27 22:42:57,943 INFO L78 Accepts]: Start accepts. Automaton has 41610 states and 128853 transitions. Word has length 65 [2019-12-27 22:42:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:57,943 INFO L462 AbstractCegarLoop]: Abstraction has 41610 states and 128853 transitions. [2019-12-27 22:42:57,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:42:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 41610 states and 128853 transitions. [2019-12-27 22:42:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:42:57,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:57,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:57,990 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 22:42:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:57,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 22:42:57,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:57,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829244316] [2019-12-27 22:42:57,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:58,065 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 22:42:58,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829244316] [2019-12-27 22:42:58,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:58,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:58,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1347450002] [2019-12-27 22:42:58,066 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:58,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:58,597 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 288 transitions. [2019-12-27 22:42:58,597 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:58,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:58,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:58,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:58,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:58,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:58,604 INFO L87 Difference]: Start difference. First operand 41610 states and 128853 transitions. Second operand 3 states. [2019-12-27 22:42:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:58,738 INFO L93 Difference]: Finished difference Result 41610 states and 128852 transitions. [2019-12-27 22:42:58,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:58,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:42:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:58,801 INFO L225 Difference]: With dead ends: 41610 [2019-12-27 22:42:58,801 INFO L226 Difference]: Without dead ends: 41610 [2019-12-27 22:42:58,802 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 22:42:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41610 states. [2019-12-27 22:42:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41610 to 34746. [2019-12-27 22:42:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34746 states. [2019-12-27 22:42:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34746 states to 34746 states and 109659 transitions. [2019-12-27 22:42:59,426 INFO L78 Accepts]: Start accepts. Automaton has 34746 states and 109659 transitions. Word has length 65 [2019-12-27 22:42:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:59,426 INFO L462 AbstractCegarLoop]: Abstraction has 34746 states and 109659 transitions. [2019-12-27 22:42:59,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 34746 states and 109659 transitions. [2019-12-27 22:42:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:42:59,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:59,471 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 22:42:59,472 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 22:42:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1323575748, now seen corresponding path program 1 times [2019-12-27 22:42:59,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:59,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583467635] [2019-12-27 22:42:59,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:59,688 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 22:42:59,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583467635] [2019-12-27 22:42:59,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:59,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:42:59,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841370696] [2019-12-27 22:42:59,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:59,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:59,907 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 274 transitions. [2019-12-27 22:42:59,908 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:00,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:43:00,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:43:00,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:00,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:43:00,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:43:00,143 INFO L87 Difference]: Start difference. First operand 34746 states and 109659 transitions. Second operand 15 states. [2019-12-27 22:43:03,647 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-27 22:43:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:43:04,718 INFO L93 Difference]: Finished difference Result 67136 states and 206523 transitions. [2019-12-27 22:43:04,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 22:43:04,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 22:43:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:43:04,828 INFO L225 Difference]: With dead ends: 67136 [2019-12-27 22:43:04,828 INFO L226 Difference]: Without dead ends: 67136 [2019-12-27 22:43:04,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 22:43:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67136 states. [2019-12-27 22:43:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67136 to 37088. [2019-12-27 22:43:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37088 states. [2019-12-27 22:43:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37088 states to 37088 states and 117295 transitions. [2019-12-27 22:43:05,705 INFO L78 Accepts]: Start accepts. Automaton has 37088 states and 117295 transitions. Word has length 66 [2019-12-27 22:43:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:43:05,705 INFO L462 AbstractCegarLoop]: Abstraction has 37088 states and 117295 transitions. [2019-12-27 22:43:05,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:43:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 37088 states and 117295 transitions. [2019-12-27 22:43:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:43:05,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:43:05,748 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 22:43:05,748 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 22:43:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:43:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash -871413024, now seen corresponding path program 2 times [2019-12-27 22:43:05,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:43:05,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337271918] [2019-12-27 22:43:05,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:43:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:43:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:43:05,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337271918] [2019-12-27 22:43:05,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:43:05,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:43:05,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1203089030] [2019-12-27 22:43:05,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:43:05,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:43:05,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 266 transitions. [2019-12-27 22:43:05,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:05,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:43:05,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:43:05,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:05,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:43:05,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:43:05,991 INFO L87 Difference]: Start difference. First operand 37088 states and 117295 transitions. Second operand 3 states. [2019-12-27 22:43:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:43:06,090 INFO L93 Difference]: Finished difference Result 29948 states and 92861 transitions. [2019-12-27 22:43:06,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:43:06,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 22:43:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:43:06,132 INFO L225 Difference]: With dead ends: 29948 [2019-12-27 22:43:06,133 INFO L226 Difference]: Without dead ends: 29948 [2019-12-27 22:43:06,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 4 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 22:43:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29948 states. [2019-12-27 22:43:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29948 to 28436. [2019-12-27 22:43:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28436 states. [2019-12-27 22:43:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28436 states to 28436 states and 88048 transitions. [2019-12-27 22:43:06,921 INFO L78 Accepts]: Start accepts. Automaton has 28436 states and 88048 transitions. Word has length 66 [2019-12-27 22:43:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:43:06,921 INFO L462 AbstractCegarLoop]: Abstraction has 28436 states and 88048 transitions. [2019-12-27 22:43:06,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:43:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 28436 states and 88048 transitions. [2019-12-27 22:43:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:43:06,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:43:06,954 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 22:43:06,954 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 22:43:06,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:43:06,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-27 22:43:06,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:43:06,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470714361] [2019-12-27 22:43:06,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:43:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:43:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:43:07,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470714361] [2019-12-27 22:43:07,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:43:07,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:43:07,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2108475656] [2019-12-27 22:43:07,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:43:07,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:43:07,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 22:43:07,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:08,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:43:08,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:43:08,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:43:08,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:43:09,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 40 times. [2019-12-27 22:43:09,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 22:43:09,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:09,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 22:43:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-12-27 22:43:09,231 INFO L87 Difference]: Start difference. First operand 28436 states and 88048 transitions. Second operand 30 states. [2019-12-27 22:43:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:43:32,626 INFO L93 Difference]: Finished difference Result 115711 states and 351750 transitions. [2019-12-27 22:43:32,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-12-27 22:43:32,626 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 22:43:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:43:32,766 INFO L225 Difference]: With dead ends: 115711 [2019-12-27 22:43:32,766 INFO L226 Difference]: Without dead ends: 90202 [2019-12-27 22:43:32,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9984 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3689, Invalid=24703, Unknown=0, NotChecked=0, Total=28392 [2019-12-27 22:43:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90202 states. [2019-12-27 22:43:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90202 to 32750. [2019-12-27 22:43:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32750 states. [2019-12-27 22:43:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32750 states to 32750 states and 101015 transitions. [2019-12-27 22:43:33,669 INFO L78 Accepts]: Start accepts. Automaton has 32750 states and 101015 transitions. Word has length 67 [2019-12-27 22:43:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:43:33,669 INFO L462 AbstractCegarLoop]: Abstraction has 32750 states and 101015 transitions. [2019-12-27 22:43:33,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 22:43:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 32750 states and 101015 transitions. [2019-12-27 22:43:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:43:33,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:43:33,707 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 22:43:33,708 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 22:43:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:43:33,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1579837296, now seen corresponding path program 2 times [2019-12-27 22:43:33,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:43:33,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860220155] [2019-12-27 22:43:33,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:43:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:43:34,221 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 22:43:34,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860220155] [2019-12-27 22:43:34,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:43:34,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:43:34,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16326888] [2019-12-27 22:43:34,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:43:34,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:43:35,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 356 states and 741 transitions. [2019-12-27 22:43:35,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:43:36,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:43:36,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:43:36,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:43:37,319 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 49 times. [2019-12-27 22:43:37,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 22:43:37,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:37,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 22:43:37,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 22:43:37,320 INFO L87 Difference]: Start difference. First operand 32750 states and 101015 transitions. Second operand 33 states. [2019-12-27 22:43:48,828 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-27 22:44:03,741 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-12-27 22:44:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:18,767 INFO L93 Difference]: Finished difference Result 118940 states and 360907 transitions. [2019-12-27 22:44:18,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2019-12-27 22:44:18,767 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-12-27 22:44:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:18,933 INFO L225 Difference]: With dead ends: 118940 [2019-12-27 22:44:18,933 INFO L226 Difference]: Without dead ends: 108885 [2019-12-27 22:44:18,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 16 SyntacticMatches, 17 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16108 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=5237, Invalid=39073, Unknown=0, NotChecked=0, Total=44310 [2019-12-27 22:44:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108885 states. [2019-12-27 22:44:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108885 to 42748. [2019-12-27 22:44:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42748 states. [2019-12-27 22:44:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42748 states to 42748 states and 132286 transitions. [2019-12-27 22:44:20,090 INFO L78 Accepts]: Start accepts. Automaton has 42748 states and 132286 transitions. Word has length 67 [2019-12-27 22:44:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:20,090 INFO L462 AbstractCegarLoop]: Abstraction has 42748 states and 132286 transitions. [2019-12-27 22:44:20,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 22:44:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 42748 states and 132286 transitions. [2019-12-27 22:44:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:44:20,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:20,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:44:20,139 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 22:44:20,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2122626696, now seen corresponding path program 3 times [2019-12-27 22:44:20,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:20,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534664030] [2019-12-27 22:44:20,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:20,574 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 22:44:20,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534664030] [2019-12-27 22:44:20,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:20,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:44:20,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1511641408] [2019-12-27 22:44:20,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:20,587 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:20,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 364 states and 767 transitions. [2019-12-27 22:44:20,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:21,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:44:21,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:44:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:44:21,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:44:22,367 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-27 22:44:22,888 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 54 times. [2019-12-27 22:44:22,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 22:44:22,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:22,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 22:44:22,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 22:44:22,889 INFO L87 Difference]: Start difference. First operand 42748 states and 132286 transitions. Second operand 34 states. [2019-12-27 22:44:50,234 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-12-27 22:44:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:51,378 INFO L93 Difference]: Finished difference Result 112560 states and 340247 transitions. [2019-12-27 22:44:51,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-12-27 22:44:51,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-12-27 22:44:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:51,552 INFO L225 Difference]: With dead ends: 112560 [2019-12-27 22:44:51,553 INFO L226 Difference]: Without dead ends: 111439 [2019-12-27 22:44:51,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 19 SyntacticMatches, 22 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12561 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=4088, Invalid=31822, Unknown=0, NotChecked=0, Total=35910 [2019-12-27 22:44:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111439 states. [2019-12-27 22:44:52,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111439 to 42820. [2019-12-27 22:44:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42820 states. [2019-12-27 22:44:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42820 states to 42820 states and 132490 transitions. [2019-12-27 22:44:52,718 INFO L78 Accepts]: Start accepts. Automaton has 42820 states and 132490 transitions. Word has length 67 [2019-12-27 22:44:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:52,718 INFO L462 AbstractCegarLoop]: Abstraction has 42820 states and 132490 transitions. [2019-12-27 22:44:52,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 22:44:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 42820 states and 132490 transitions. [2019-12-27 22:44:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:44:52,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:52,766 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 22:44:52,766 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 22:44:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:52,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1590486634, now seen corresponding path program 4 times [2019-12-27 22:44:52,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:52,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219889144] [2019-12-27 22:44:52,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:52,885 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 22:44:52,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219889144] [2019-12-27 22:44:52,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:52,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:44:52,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205443120] [2019-12-27 22:44:52,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:52,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:53,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 597 transitions. [2019-12-27 22:44:53,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:53,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:44:53,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:44:53,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:44:53,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:44:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:44:53,727 INFO L87 Difference]: Start difference. First operand 42820 states and 132490 transitions. Second operand 15 states. Received shutdown request... [2019-12-27 22:44:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:44:55,915 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 22:44:55,922 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 22:44:55,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:44:55 BasicIcfg [2019-12-27 22:44:55,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:44:55,924 INFO L168 Benchmark]: Toolchain (without parser) took 226244.05 ms. Allocated memory was 145.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 102.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:44:55,932 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 22:44:55,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.92 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 156.5 MB in the end (delta: -54.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:55,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.07 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:55,933 INFO L168 Benchmark]: Boogie Preprocessor took 42.11 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:55,934 INFO L168 Benchmark]: RCFGBuilder took 852.22 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 101.3 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:55,934 INFO L168 Benchmark]: TraceAbstraction took 224503.44 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:44:55,936 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.26 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.92 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 156.5 MB in the end (delta: -54.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.07 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.11 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.22 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 101.3 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224503.44 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6847 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 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 (42820states) and FLOYD_HOARE automaton (currently 18 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (35596 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (42820states) and FLOYD_HOARE automaton (currently 18 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (35596 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: TIMEOUT, OverallTime: 224.2s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 140.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8403 SDtfs, 19530 SDslu, 42959 SDs, 0 SdLazy, 62872 SolverSat, 1405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1275 GetRequests, 211 SyntacticMatches, 144 SemanticMatches, 920 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42139 ImplicationChecksByTransitivity, 43.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 614772 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1419 NumberOfCodeBlocks, 1419 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1390 ConstructedInterpolants, 0 QuantifiedInterpolants, 338288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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