/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:55:01,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:55:01,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:55:01,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:55:01,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:55:01,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:55:01,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:55:01,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:55:01,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:55:01,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:55:01,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:55:01,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:55:01,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:55:01,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:55:01,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:55:01,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:55:01,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:55:01,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:55:01,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:55:01,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:55:01,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:55:01,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:55:01,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:55:01,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:55:01,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:55:01,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:55:01,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:55:01,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:55:01,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:55:01,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:55:01,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:55:01,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:55:01,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:55:01,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:55:01,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:55:01,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:55:01,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:55:01,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:55:01,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:55:01,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:55:01,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:55:01,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-28 03:55:01,422 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:55:01,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:55:01,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:55:01,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:55:01,424 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:55:01,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:55:01,424 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:55:01,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:55:01,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:55:01,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:55:01,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:55:01,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:55:01,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:55:01,425 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:55:01,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:55:01,426 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:55:01,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:55:01,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:55:01,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:55:01,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:55:01,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:55:01,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:55:01,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:55:01,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:55:01,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:55:01,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:55:01,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:55:01,428 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:55:01,429 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:55:01,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:55:01,429 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:55:01,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:55:01,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:55:01,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:55:01,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:55:01,742 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:55:01,743 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:55:01,744 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i [2019-12-28 03:55:01,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0fed3d8/6bc47f72ba2e4c9590c71c96bcb3528a/FLAG388e7fb97 [2019-12-28 03:55:02,328 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:55:02,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i [2019-12-28 03:55:02,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0fed3d8/6bc47f72ba2e4c9590c71c96bcb3528a/FLAG388e7fb97 [2019-12-28 03:55:02,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0fed3d8/6bc47f72ba2e4c9590c71c96bcb3528a [2019-12-28 03:55:02,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:55:02,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:55:02,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:55:02,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:55:02,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:55:02,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:55:02" (1/1) ... [2019-12-28 03:55:02,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:02, skipping insertion in model container [2019-12-28 03:55:02,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:55:02" (1/1) ... [2019-12-28 03:55:02,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:55:02,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:55:03,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:55:03,350 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:55:03,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:55:03,496 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:55:03,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03 WrapperNode [2019-12-28 03:55:03,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:55:03,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:55:03,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:55:03,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:55:03,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... [2019-12-28 03:55:03,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... [2019-12-28 03:55:03,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:55:03,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:55:03,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:55:03,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:55:03,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... [2019-12-28 03:55:03,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... [2019-12-28 03:55:03,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... [2019-12-28 03:55:03,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... [2019-12-28 03:55:03,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... [2019-12-28 03:55:03,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... [2019-12-28 03:55:03,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... [2019-12-28 03:55:03,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:55:03,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:55:03,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:55:03,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:55:03,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:55:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:55:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:55:03,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:55:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:55:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:55:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:55:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:55:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:55:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:55:03,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:55:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:55:03,703 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:55:04,633 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:55:04,633 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:55:04,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:55:04 BoogieIcfgContainer [2019-12-28 03:55:04,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:55:04,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:55:04,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:55:04,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:55:04,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:55:02" (1/3) ... [2019-12-28 03:55:04,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257fccd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:55:04, skipping insertion in model container [2019-12-28 03:55:04,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:55:03" (2/3) ... [2019-12-28 03:55:04,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257fccd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:55:04, skipping insertion in model container [2019-12-28 03:55:04,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:55:04" (3/3) ... [2019-12-28 03:55:04,645 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.opt.i [2019-12-28 03:55:04,653 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:55:04,653 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:55:04,660 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:55:04,661 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:55:04,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,762 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,762 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,811 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,814 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,829 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:55:04,845 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:55:04,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:55:04,861 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:55:04,861 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:55:04,861 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:55:04,861 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:55:04,862 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:55:04,862 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:55:04,862 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:55:04,875 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 179 places, 228 transitions [2019-12-28 03:55:13,252 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80073 states. [2019-12-28 03:55:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 80073 states. [2019-12-28 03:55:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-28 03:55:13,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:13,267 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-28 03:55:13,268 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:13,274 INFO L82 PathProgramCache]: Analyzing trace with hash -603534954, now seen corresponding path program 1 times [2019-12-28 03:55:13,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:13,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210697135] [2019-12-28 03:55:13,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:55:13,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210697135] [2019-12-28 03:55:13,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:13,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:55:13,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [731816836] [2019-12-28 03:55:13,631 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:13,639 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:13,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-28 03:55:13,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:13,676 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:13,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:55:13,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:13,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:55:13,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:55:13,695 INFO L87 Difference]: Start difference. First operand 80073 states. Second operand 4 states. [2019-12-28 03:55:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:16,113 INFO L93 Difference]: Finished difference Result 80713 states and 324638 transitions. [2019-12-28 03:55:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:55:16,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-28 03:55:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:16,613 INFO L225 Difference]: With dead ends: 80713 [2019-12-28 03:55:16,613 INFO L226 Difference]: Without dead ends: 59001 [2019-12-28 03:55:16,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:55:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59001 states. [2019-12-28 03:55:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59001 to 59001. [2019-12-28 03:55:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59001 states. [2019-12-28 03:55:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59001 states to 59001 states and 240126 transitions. [2019-12-28 03:55:21,546 INFO L78 Accepts]: Start accepts. Automaton has 59001 states and 240126 transitions. Word has length 40 [2019-12-28 03:55:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:21,546 INFO L462 AbstractCegarLoop]: Abstraction has 59001 states and 240126 transitions. [2019-12-28 03:55:21,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:55:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 59001 states and 240126 transitions. [2019-12-28 03:55:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:55:21,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:21,557 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] [2019-12-28 03:55:21,557 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1788922938, now seen corresponding path program 1 times [2019-12-28 03:55:21,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:21,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955399377] [2019-12-28 03:55:21,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:55:21,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955399377] [2019-12-28 03:55:21,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:21,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:55:21,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1272484439] [2019-12-28 03:55:21,660 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:21,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:21,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 03:55:21,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:21,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:21,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:55:21,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:21,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:55:21,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:55:21,672 INFO L87 Difference]: Start difference. First operand 59001 states and 240126 transitions. Second operand 5 states. [2019-12-28 03:55:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:24,980 INFO L93 Difference]: Finished difference Result 95595 states and 363717 transitions. [2019-12-28 03:55:24,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:55:24,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 03:55:24,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:25,335 INFO L225 Difference]: With dead ends: 95595 [2019-12-28 03:55:25,335 INFO L226 Difference]: Without dead ends: 95043 [2019-12-28 03:55:25,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:55:26,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95043 states. [2019-12-28 03:55:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95043 to 93165. [2019-12-28 03:55:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93165 states. [2019-12-28 03:55:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93165 states to 93165 states and 356303 transitions. [2019-12-28 03:55:33,055 INFO L78 Accepts]: Start accepts. Automaton has 93165 states and 356303 transitions. Word has length 48 [2019-12-28 03:55:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:33,057 INFO L462 AbstractCegarLoop]: Abstraction has 93165 states and 356303 transitions. [2019-12-28 03:55:33,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:55:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 93165 states and 356303 transitions. [2019-12-28 03:55:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 03:55:33,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:33,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:55:33,063 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:33,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash -746061459, now seen corresponding path program 1 times [2019-12-28 03:55:33,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:33,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141188931] [2019-12-28 03:55:33,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:55:33,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141188931] [2019-12-28 03:55:33,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:33,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:55:33,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946201369] [2019-12-28 03:55:33,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:33,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:33,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 121 transitions. [2019-12-28 03:55:33,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:33,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:55:33,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:55:33,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:55:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:55:33,251 INFO L87 Difference]: Start difference. First operand 93165 states and 356303 transitions. Second operand 6 states. [2019-12-28 03:55:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:34,425 INFO L93 Difference]: Finished difference Result 118509 states and 442884 transitions. [2019-12-28 03:55:34,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:55:34,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-28 03:55:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:34,918 INFO L225 Difference]: With dead ends: 118509 [2019-12-28 03:55:34,919 INFO L226 Difference]: Without dead ends: 118061 [2019-12-28 03:55:34,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:55:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118061 states. [2019-12-28 03:55:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118061 to 104154. [2019-12-28 03:55:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104154 states. [2019-12-28 03:55:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104154 states to 104154 states and 394237 transitions. [2019-12-28 03:55:44,551 INFO L78 Accepts]: Start accepts. Automaton has 104154 states and 394237 transitions. Word has length 49 [2019-12-28 03:55:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:44,551 INFO L462 AbstractCegarLoop]: Abstraction has 104154 states and 394237 transitions. [2019-12-28 03:55:44,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:55:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 104154 states and 394237 transitions. [2019-12-28 03:55:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 03:55:44,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:44,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:55:44,561 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:44,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:44,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1178009107, now seen corresponding path program 1 times [2019-12-28 03:55:44,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:44,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041751509] [2019-12-28 03:55:44,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:55:44,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041751509] [2019-12-28 03:55:44,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:44,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:55:44,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597094403] [2019-12-28 03:55:44,648 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:44,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:44,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 139 transitions. [2019-12-28 03:55:44,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:44,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:55:44,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:55:44,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:55:44,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:55:44,715 INFO L87 Difference]: Start difference. First operand 104154 states and 394237 transitions. Second operand 5 states. [2019-12-28 03:55:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:45,660 INFO L93 Difference]: Finished difference Result 170912 states and 627059 transitions. [2019-12-28 03:55:45,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:55:45,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-28 03:55:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:46,792 INFO L225 Difference]: With dead ends: 170912 [2019-12-28 03:55:46,792 INFO L226 Difference]: Without dead ends: 170912 [2019-12-28 03:55:46,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:55:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170912 states. [2019-12-28 03:55:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170912 to 157190. [2019-12-28 03:55:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157190 states. [2019-12-28 03:55:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157190 states to 157190 states and 581291 transitions. [2019-12-28 03:55:59,825 INFO L78 Accepts]: Start accepts. Automaton has 157190 states and 581291 transitions. Word has length 51 [2019-12-28 03:55:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:59,825 INFO L462 AbstractCegarLoop]: Abstraction has 157190 states and 581291 transitions. [2019-12-28 03:55:59,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:55:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 157190 states and 581291 transitions. [2019-12-28 03:55:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:55:59,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:59,849 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] [2019-12-28 03:55:59,850 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:59,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:59,850 INFO L82 PathProgramCache]: Analyzing trace with hash 105108318, now seen corresponding path program 1 times [2019-12-28 03:55:59,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:59,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194259983] [2019-12-28 03:55:59,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:55:59,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194259983] [2019-12-28 03:55:59,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:59,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:55:59,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2137038157] [2019-12-28 03:55:59,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:59,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:59,951 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 175 transitions. [2019-12-28 03:55:59,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:59,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:55:59,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:55:59,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:59,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:55:59,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:55:59,991 INFO L87 Difference]: Start difference. First operand 157190 states and 581291 transitions. Second operand 8 states. [2019-12-28 03:56:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:01,762 INFO L93 Difference]: Finished difference Result 212574 states and 766173 transitions. [2019-12-28 03:56:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:56:01,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 03:56:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:02,853 INFO L225 Difference]: With dead ends: 212574 [2019-12-28 03:56:02,854 INFO L226 Difference]: Without dead ends: 212054 [2019-12-28 03:56:02,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:56:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212054 states. [2019-12-28 03:56:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212054 to 157972. [2019-12-28 03:56:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157972 states. [2019-12-28 03:56:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157972 states to 157972 states and 584228 transitions. [2019-12-28 03:56:09,882 INFO L78 Accepts]: Start accepts. Automaton has 157972 states and 584228 transitions. Word has length 55 [2019-12-28 03:56:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:09,883 INFO L462 AbstractCegarLoop]: Abstraction has 157972 states and 584228 transitions. [2019-12-28 03:56:09,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:56:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 157972 states and 584228 transitions. [2019-12-28 03:56:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:56:09,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:09,903 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] [2019-12-28 03:56:09,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:09,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:09,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2117067120, now seen corresponding path program 1 times [2019-12-28 03:56:09,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:09,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646073117] [2019-12-28 03:56:09,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:56:10,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646073117] [2019-12-28 03:56:10,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:10,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:56:10,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1447084643] [2019-12-28 03:56:10,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:10,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:10,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:56:10,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:10,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:56:10,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:56:10,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:10,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:56:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:56:10,068 INFO L87 Difference]: Start difference. First operand 157972 states and 584228 transitions. Second operand 8 states. [2019-12-28 03:56:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:13,159 INFO L93 Difference]: Finished difference Result 208199 states and 766452 transitions. [2019-12-28 03:56:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:56:13,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 03:56:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:13,698 INFO L225 Difference]: With dead ends: 208199 [2019-12-28 03:56:13,698 INFO L226 Difference]: Without dead ends: 208199 [2019-12-28 03:56:13,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:56:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208199 states. [2019-12-28 03:56:24,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208199 to 193995. [2019-12-28 03:56:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193995 states. [2019-12-28 03:56:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193995 states to 193995 states and 714236 transitions. [2019-12-28 03:56:25,368 INFO L78 Accepts]: Start accepts. Automaton has 193995 states and 714236 transitions. Word has length 55 [2019-12-28 03:56:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:25,369 INFO L462 AbstractCegarLoop]: Abstraction has 193995 states and 714236 transitions. [2019-12-28 03:56:25,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:56:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 193995 states and 714236 transitions. [2019-12-28 03:56:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:56:25,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:25,392 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] [2019-12-28 03:56:25,393 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:25,393 INFO L82 PathProgramCache]: Analyzing trace with hash 380948817, now seen corresponding path program 1 times [2019-12-28 03:56:25,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:25,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813123076] [2019-12-28 03:56:25,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:56:25,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813123076] [2019-12-28 03:56:25,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:25,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:56:25,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1145194127] [2019-12-28 03:56:25,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:25,500 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:25,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:56:25,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:25,535 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:56:25,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:56:25,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:25,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:56:25,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:56:25,537 INFO L87 Difference]: Start difference. First operand 193995 states and 714236 transitions. Second operand 9 states. [2019-12-28 03:56:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:32,595 INFO L93 Difference]: Finished difference Result 277138 states and 986576 transitions. [2019-12-28 03:56:32,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:56:32,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-28 03:56:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:34,024 INFO L225 Difference]: With dead ends: 277138 [2019-12-28 03:56:34,024 INFO L226 Difference]: Without dead ends: 277138 [2019-12-28 03:56:34,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:56:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277138 states. [2019-12-28 03:56:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277138 to 222094. [2019-12-28 03:56:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222094 states. [2019-12-28 03:56:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222094 states to 222094 states and 805380 transitions. [2019-12-28 03:56:46,086 INFO L78 Accepts]: Start accepts. Automaton has 222094 states and 805380 transitions. Word has length 55 [2019-12-28 03:56:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:46,086 INFO L462 AbstractCegarLoop]: Abstraction has 222094 states and 805380 transitions. [2019-12-28 03:56:46,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:56:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 222094 states and 805380 transitions. [2019-12-28 03:56:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:56:46,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:46,111 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] [2019-12-28 03:56:46,112 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:46,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1268452498, now seen corresponding path program 1 times [2019-12-28 03:56:46,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:46,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884378798] [2019-12-28 03:56:46,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:56:46,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884378798] [2019-12-28 03:56:46,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:46,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:56:46,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [748834772] [2019-12-28 03:56:46,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:46,182 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:46,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:56:46,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:46,189 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:46,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:56:46,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:46,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:56:46,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:56:46,190 INFO L87 Difference]: Start difference. First operand 222094 states and 805380 transitions. Second operand 3 states. [2019-12-28 03:56:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:47,135 INFO L93 Difference]: Finished difference Result 176990 states and 632038 transitions. [2019-12-28 03:56:47,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:56:47,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-28 03:56:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:47,561 INFO L225 Difference]: With dead ends: 176990 [2019-12-28 03:56:47,562 INFO L226 Difference]: Without dead ends: 176990 [2019-12-28 03:56:47,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:56:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176990 states. [2019-12-28 03:56:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176990 to 172178. [2019-12-28 03:56:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172178 states. [2019-12-28 03:56:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172178 states to 172178 states and 617063 transitions. [2019-12-28 03:56:58,631 INFO L78 Accepts]: Start accepts. Automaton has 172178 states and 617063 transitions. Word has length 55 [2019-12-28 03:56:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:58,631 INFO L462 AbstractCegarLoop]: Abstraction has 172178 states and 617063 transitions. [2019-12-28 03:56:58,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:56:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 172178 states and 617063 transitions. [2019-12-28 03:56:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 03:56:58,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:58,652 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] [2019-12-28 03:56:58,652 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:58,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash 885774422, now seen corresponding path program 1 times [2019-12-28 03:56:58,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:58,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145229906] [2019-12-28 03:56:58,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:56:58,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145229906] [2019-12-28 03:56:58,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:58,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:56:58,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977988894] [2019-12-28 03:56:58,757 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:58,762 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:58,767 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 03:56:58,767 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:58,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:58,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:56:58,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:58,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:56:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:56:58,769 INFO L87 Difference]: Start difference. First operand 172178 states and 617063 transitions. Second operand 6 states. [2019-12-28 03:57:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:01,435 INFO L93 Difference]: Finished difference Result 216117 states and 757196 transitions. [2019-12-28 03:57:01,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:57:01,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-28 03:57:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:02,009 INFO L225 Difference]: With dead ends: 216117 [2019-12-28 03:57:02,010 INFO L226 Difference]: Without dead ends: 216117 [2019-12-28 03:57:02,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216117 states. [2019-12-28 03:57:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216117 to 185518. [2019-12-28 03:57:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185518 states. [2019-12-28 03:57:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185518 states to 185518 states and 660438 transitions. [2019-12-28 03:57:14,944 INFO L78 Accepts]: Start accepts. Automaton has 185518 states and 660438 transitions. Word has length 56 [2019-12-28 03:57:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:14,945 INFO L462 AbstractCegarLoop]: Abstraction has 185518 states and 660438 transitions. [2019-12-28 03:57:14,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:57:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 185518 states and 660438 transitions. [2019-12-28 03:57:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 03:57:14,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:14,965 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] [2019-12-28 03:57:14,965 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:14,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:14,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1773278103, now seen corresponding path program 1 times [2019-12-28 03:57:14,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:14,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819397634] [2019-12-28 03:57:14,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:15,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819397634] [2019-12-28 03:57:15,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:15,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:57:15,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1943263405] [2019-12-28 03:57:15,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:15,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:15,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 03:57:15,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:15,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:15,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:57:15,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:15,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:57:15,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:57:15,041 INFO L87 Difference]: Start difference. First operand 185518 states and 660438 transitions. Second operand 4 states. [2019-12-28 03:57:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:15,164 INFO L93 Difference]: Finished difference Result 24458 states and 76334 transitions. [2019-12-28 03:57:15,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:57:15,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-28 03:57:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:15,196 INFO L225 Difference]: With dead ends: 24458 [2019-12-28 03:57:15,196 INFO L226 Difference]: Without dead ends: 18439 [2019-12-28 03:57:15,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:57:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2019-12-28 03:57:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 18192. [2019-12-28 03:57:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18192 states. [2019-12-28 03:57:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18192 states to 18192 states and 54575 transitions. [2019-12-28 03:57:15,444 INFO L78 Accepts]: Start accepts. Automaton has 18192 states and 54575 transitions. Word has length 56 [2019-12-28 03:57:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:15,444 INFO L462 AbstractCegarLoop]: Abstraction has 18192 states and 54575 transitions. [2019-12-28 03:57:15,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:57:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 18192 states and 54575 transitions. [2019-12-28 03:57:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 03:57:15,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:15,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:15,450 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:15,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:15,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1597390281, now seen corresponding path program 1 times [2019-12-28 03:57:15,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:15,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411516817] [2019-12-28 03:57:15,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:15,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411516817] [2019-12-28 03:57:15,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:15,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:57:15,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735790085] [2019-12-28 03:57:15,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:15,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:15,553 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 03:57:15,553 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:15,568 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:57:15,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:57:15,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:15,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:57:15,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:57:15,570 INFO L87 Difference]: Start difference. First operand 18192 states and 54575 transitions. Second operand 5 states. [2019-12-28 03:57:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:15,891 INFO L93 Difference]: Finished difference Result 23512 states and 70753 transitions. [2019-12-28 03:57:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:57:15,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-28 03:57:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:15,925 INFO L225 Difference]: With dead ends: 23512 [2019-12-28 03:57:15,925 INFO L226 Difference]: Without dead ends: 23512 [2019-12-28 03:57:15,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:57:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23512 states. [2019-12-28 03:57:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23512 to 21214. [2019-12-28 03:57:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21214 states. [2019-12-28 03:57:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21214 states to 21214 states and 63560 transitions. [2019-12-28 03:57:16,218 INFO L78 Accepts]: Start accepts. Automaton has 21214 states and 63560 transitions. Word has length 65 [2019-12-28 03:57:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:16,218 INFO L462 AbstractCegarLoop]: Abstraction has 21214 states and 63560 transitions. [2019-12-28 03:57:16,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:57:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 21214 states and 63560 transitions. [2019-12-28 03:57:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 03:57:16,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:16,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:16,224 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash -954766680, now seen corresponding path program 1 times [2019-12-28 03:57:16,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:16,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535584836] [2019-12-28 03:57:16,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:16,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535584836] [2019-12-28 03:57:16,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:16,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:57:16,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136981474] [2019-12-28 03:57:16,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:16,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:16,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 03:57:16,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:16,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:57:16,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:57:16,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:16,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:57:16,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:16,368 INFO L87 Difference]: Start difference. First operand 21214 states and 63560 transitions. Second operand 7 states. [2019-12-28 03:57:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:18,557 INFO L93 Difference]: Finished difference Result 30326 states and 89100 transitions. [2019-12-28 03:57:18,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:57:18,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-28 03:57:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:18,602 INFO L225 Difference]: With dead ends: 30326 [2019-12-28 03:57:18,602 INFO L226 Difference]: Without dead ends: 30278 [2019-12-28 03:57:18,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:57:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30278 states. [2019-12-28 03:57:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30278 to 27631. [2019-12-28 03:57:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27631 states. [2019-12-28 03:57:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 81447 transitions. [2019-12-28 03:57:18,972 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 81447 transitions. Word has length 65 [2019-12-28 03:57:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:18,972 INFO L462 AbstractCegarLoop]: Abstraction has 27631 states and 81447 transitions. [2019-12-28 03:57:18,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:57:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 81447 transitions. [2019-12-28 03:57:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 03:57:18,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:18,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:18,982 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:18,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1040500071, now seen corresponding path program 1 times [2019-12-28 03:57:18,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:18,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370846978] [2019-12-28 03:57:18,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:19,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370846978] [2019-12-28 03:57:19,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:19,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:57:19,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1914769481] [2019-12-28 03:57:19,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:19,031 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:19,070 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 255 transitions. [2019-12-28 03:57:19,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:19,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:57:19,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:57:19,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:19,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:57:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:57:19,103 INFO L87 Difference]: Start difference. First operand 27631 states and 81447 transitions. Second operand 5 states. [2019-12-28 03:57:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:19,323 INFO L93 Difference]: Finished difference Result 30274 states and 87661 transitions. [2019-12-28 03:57:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:57:19,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 03:57:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:19,383 INFO L225 Difference]: With dead ends: 30274 [2019-12-28 03:57:19,383 INFO L226 Difference]: Without dead ends: 30274 [2019-12-28 03:57:19,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:57:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30274 states. [2019-12-28 03:57:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30274 to 26779. [2019-12-28 03:57:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26779 states. [2019-12-28 03:57:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26779 states to 26779 states and 76975 transitions. [2019-12-28 03:57:19,844 INFO L78 Accepts]: Start accepts. Automaton has 26779 states and 76975 transitions. Word has length 71 [2019-12-28 03:57:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:19,844 INFO L462 AbstractCegarLoop]: Abstraction has 26779 states and 76975 transitions. [2019-12-28 03:57:19,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:57:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 26779 states and 76975 transitions. [2019-12-28 03:57:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 03:57:19,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:19,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:19,859 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:19,860 INFO L82 PathProgramCache]: Analyzing trace with hash 199326872, now seen corresponding path program 1 times [2019-12-28 03:57:19,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:19,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940560961] [2019-12-28 03:57:19,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:19,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940560961] [2019-12-28 03:57:19,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:19,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:57:19,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1890902381] [2019-12-28 03:57:19,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:19,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:20,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 209 transitions. [2019-12-28 03:57:20,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:20,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:20,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:57:20,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:20,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:57:20,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:57:20,166 INFO L87 Difference]: Start difference. First operand 26779 states and 76975 transitions. Second operand 4 states. [2019-12-28 03:57:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:21,051 INFO L93 Difference]: Finished difference Result 35101 states and 101171 transitions. [2019-12-28 03:57:21,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:57:21,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-28 03:57:21,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:21,109 INFO L225 Difference]: With dead ends: 35101 [2019-12-28 03:57:21,109 INFO L226 Difference]: Without dead ends: 34678 [2019-12-28 03:57:21,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:57:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34678 states. [2019-12-28 03:57:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34678 to 32875. [2019-12-28 03:57:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32875 states. [2019-12-28 03:57:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32875 states to 32875 states and 94659 transitions. [2019-12-28 03:57:21,577 INFO L78 Accepts]: Start accepts. Automaton has 32875 states and 94659 transitions. Word has length 73 [2019-12-28 03:57:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:21,577 INFO L462 AbstractCegarLoop]: Abstraction has 32875 states and 94659 transitions. [2019-12-28 03:57:21,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:57:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32875 states and 94659 transitions. [2019-12-28 03:57:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 03:57:21,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:21,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:21,591 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:21,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:21,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1597624487, now seen corresponding path program 1 times [2019-12-28 03:57:21,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:21,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389016867] [2019-12-28 03:57:21,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:21,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389016867] [2019-12-28 03:57:21,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:21,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:21,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418573032] [2019-12-28 03:57:21,687 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:21,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:21,733 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 209 transitions. [2019-12-28 03:57:21,733 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:21,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:57:21,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:57:21,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:57:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:21,773 INFO L87 Difference]: Start difference. First operand 32875 states and 94659 transitions. Second operand 8 states. [2019-12-28 03:57:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:22,692 INFO L93 Difference]: Finished difference Result 46954 states and 134687 transitions. [2019-12-28 03:57:22,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:57:22,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-12-28 03:57:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:22,757 INFO L225 Difference]: With dead ends: 46954 [2019-12-28 03:57:22,758 INFO L226 Difference]: Without dead ends: 46954 [2019-12-28 03:57:22,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:57:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46954 states. [2019-12-28 03:57:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46954 to 38263. [2019-12-28 03:57:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38263 states. [2019-12-28 03:57:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38263 states to 38263 states and 110017 transitions. [2019-12-28 03:57:23,513 INFO L78 Accepts]: Start accepts. Automaton has 38263 states and 110017 transitions. Word has length 73 [2019-12-28 03:57:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:23,514 INFO L462 AbstractCegarLoop]: Abstraction has 38263 states and 110017 transitions. [2019-12-28 03:57:23,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:57:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 38263 states and 110017 transitions. [2019-12-28 03:57:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 03:57:23,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:23,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:23,531 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:23,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash -710120806, now seen corresponding path program 1 times [2019-12-28 03:57:23,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:23,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097665778] [2019-12-28 03:57:23,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:23,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097665778] [2019-12-28 03:57:23,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:23,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:57:23,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1049535233] [2019-12-28 03:57:23,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:23,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:23,653 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 209 transitions. [2019-12-28 03:57:23,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:23,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:57:23,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:57:23,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:57:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:57:23,673 INFO L87 Difference]: Start difference. First operand 38263 states and 110017 transitions. Second operand 6 states. [2019-12-28 03:57:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:23,749 INFO L93 Difference]: Finished difference Result 10492 states and 26178 transitions. [2019-12-28 03:57:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:57:23,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-28 03:57:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:23,762 INFO L225 Difference]: With dead ends: 10492 [2019-12-28 03:57:23,762 INFO L226 Difference]: Without dead ends: 9187 [2019-12-28 03:57:23,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9187 states. [2019-12-28 03:57:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9187 to 7132. [2019-12-28 03:57:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7132 states. [2019-12-28 03:57:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7132 states to 7132 states and 17788 transitions. [2019-12-28 03:57:23,872 INFO L78 Accepts]: Start accepts. Automaton has 7132 states and 17788 transitions. Word has length 73 [2019-12-28 03:57:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:23,873 INFO L462 AbstractCegarLoop]: Abstraction has 7132 states and 17788 transitions. [2019-12-28 03:57:23,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:57:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7132 states and 17788 transitions. [2019-12-28 03:57:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:23,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:23,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:23,881 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:23,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:23,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1025343549, now seen corresponding path program 1 times [2019-12-28 03:57:23,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:23,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131458558] [2019-12-28 03:57:23,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:23,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131458558] [2019-12-28 03:57:23,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:23,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:57:23,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761414238] [2019-12-28 03:57:23,987 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:24,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:24,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-28 03:57:24,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:24,134 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:24,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:57:24,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:24,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:57:24,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:57:24,135 INFO L87 Difference]: Start difference. First operand 7132 states and 17788 transitions. Second operand 4 states. [2019-12-28 03:57:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:24,408 INFO L93 Difference]: Finished difference Result 8324 states and 20383 transitions. [2019-12-28 03:57:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:57:24,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-28 03:57:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:24,421 INFO L225 Difference]: With dead ends: 8324 [2019-12-28 03:57:24,421 INFO L226 Difference]: Without dead ends: 8324 [2019-12-28 03:57:24,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:57:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2019-12-28 03:57:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 7754. [2019-12-28 03:57:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7754 states. [2019-12-28 03:57:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7754 states to 7754 states and 19140 transitions. [2019-12-28 03:57:24,633 INFO L78 Accepts]: Start accepts. Automaton has 7754 states and 19140 transitions. Word has length 102 [2019-12-28 03:57:24,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:24,634 INFO L462 AbstractCegarLoop]: Abstraction has 7754 states and 19140 transitions. [2019-12-28 03:57:24,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:57:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7754 states and 19140 transitions. [2019-12-28 03:57:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:24,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:24,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:24,644 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:24,644 INFO L82 PathProgramCache]: Analyzing trace with hash 219420932, now seen corresponding path program 1 times [2019-12-28 03:57:24,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:24,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413317762] [2019-12-28 03:57:24,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:24,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413317762] [2019-12-28 03:57:24,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:24,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:57:24,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842880586] [2019-12-28 03:57:24,745 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:24,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:24,880 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-28 03:57:24,880 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:24,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:57:24,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:57:24,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:24,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:57:24,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:57:24,938 INFO L87 Difference]: Start difference. First operand 7754 states and 19140 transitions. Second operand 10 states. [2019-12-28 03:57:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:29,250 INFO L93 Difference]: Finished difference Result 22689 states and 53485 transitions. [2019-12-28 03:57:29,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-28 03:57:29,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2019-12-28 03:57:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:29,291 INFO L225 Difference]: With dead ends: 22689 [2019-12-28 03:57:29,292 INFO L226 Difference]: Without dead ends: 22527 [2019-12-28 03:57:29,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2019-12-28 03:57:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22527 states. [2019-12-28 03:57:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22527 to 14157. [2019-12-28 03:57:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14157 states. [2019-12-28 03:57:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 34209 transitions. [2019-12-28 03:57:29,912 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 34209 transitions. Word has length 102 [2019-12-28 03:57:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:29,913 INFO L462 AbstractCegarLoop]: Abstraction has 14157 states and 34209 transitions. [2019-12-28 03:57:29,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:57:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 34209 transitions. [2019-12-28 03:57:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:29,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:29,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:29,938 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:29,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1857788411, now seen corresponding path program 1 times [2019-12-28 03:57:29,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:29,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607114124] [2019-12-28 03:57:29,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:30,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607114124] [2019-12-28 03:57:30,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:30,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:30,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [176666321] [2019-12-28 03:57:30,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:30,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:30,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-28 03:57:30,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:30,293 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 03:57:30,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:57:30,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:30,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:57:30,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:57:30,295 INFO L87 Difference]: Start difference. First operand 14157 states and 34209 transitions. Second operand 9 states. [2019-12-28 03:57:32,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:32,167 INFO L93 Difference]: Finished difference Result 25878 states and 59882 transitions. [2019-12-28 03:57:32,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-28 03:57:32,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-12-28 03:57:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:32,197 INFO L225 Difference]: With dead ends: 25878 [2019-12-28 03:57:32,197 INFO L226 Difference]: Without dead ends: 25878 [2019-12-28 03:57:32,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2019-12-28 03:57:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25878 states. [2019-12-28 03:57:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25878 to 16434. [2019-12-28 03:57:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16434 states. [2019-12-28 03:57:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16434 states to 16434 states and 38575 transitions. [2019-12-28 03:57:32,433 INFO L78 Accepts]: Start accepts. Automaton has 16434 states and 38575 transitions. Word has length 102 [2019-12-28 03:57:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:32,433 INFO L462 AbstractCegarLoop]: Abstraction has 16434 states and 38575 transitions. [2019-12-28 03:57:32,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:57:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 16434 states and 38575 transitions. [2019-12-28 03:57:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:32,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:32,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:32,448 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1646437498, now seen corresponding path program 1 times [2019-12-28 03:57:32,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:32,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573388114] [2019-12-28 03:57:32,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:32,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573388114] [2019-12-28 03:57:32,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:32,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:32,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1181692425] [2019-12-28 03:57:32,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:32,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:32,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-28 03:57:32,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:32,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:57:32,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:57:32,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:57:32,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:57:32,774 INFO L87 Difference]: Start difference. First operand 16434 states and 38575 transitions. Second operand 9 states. [2019-12-28 03:57:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:34,460 INFO L93 Difference]: Finished difference Result 24625 states and 57141 transitions. [2019-12-28 03:57:34,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-28 03:57:34,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-12-28 03:57:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:34,488 INFO L225 Difference]: With dead ends: 24625 [2019-12-28 03:57:34,488 INFO L226 Difference]: Without dead ends: 24625 [2019-12-28 03:57:34,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2019-12-28 03:57:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24625 states. [2019-12-28 03:57:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24625 to 16991. [2019-12-28 03:57:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16991 states. [2019-12-28 03:57:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16991 states to 16991 states and 39796 transitions. [2019-12-28 03:57:34,711 INFO L78 Accepts]: Start accepts. Automaton has 16991 states and 39796 transitions. Word has length 102 [2019-12-28 03:57:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:34,711 INFO L462 AbstractCegarLoop]: Abstraction has 16991 states and 39796 transitions. [2019-12-28 03:57:34,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:57:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand 16991 states and 39796 transitions. [2019-12-28 03:57:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:34,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:34,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:34,727 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:34,727 INFO L82 PathProgramCache]: Analyzing trace with hash -546459419, now seen corresponding path program 1 times [2019-12-28 03:57:34,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:34,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183985182] [2019-12-28 03:57:34,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:34,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183985182] [2019-12-28 03:57:34,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:34,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:34,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757691325] [2019-12-28 03:57:34,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:34,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:34,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-28 03:57:34,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:34,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:57:34,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:57:34,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:34,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:57:34,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:35,000 INFO L87 Difference]: Start difference. First operand 16991 states and 39796 transitions. Second operand 7 states. [2019-12-28 03:57:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:35,342 INFO L93 Difference]: Finished difference Result 17922 states and 41731 transitions. [2019-12-28 03:57:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:57:35,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-28 03:57:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:35,361 INFO L225 Difference]: With dead ends: 17922 [2019-12-28 03:57:35,361 INFO L226 Difference]: Without dead ends: 17922 [2019-12-28 03:57:35,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:57:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17922 states. [2019-12-28 03:57:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17922 to 16179. [2019-12-28 03:57:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16179 states. [2019-12-28 03:57:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16179 states to 16179 states and 37959 transitions. [2019-12-28 03:57:35,675 INFO L78 Accepts]: Start accepts. Automaton has 16179 states and 37959 transitions. Word has length 102 [2019-12-28 03:57:35,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:35,675 INFO L462 AbstractCegarLoop]: Abstraction has 16179 states and 37959 transitions. [2019-12-28 03:57:35,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:57:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 16179 states and 37959 transitions. [2019-12-28 03:57:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:35,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:35,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:35,689 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash 341044262, now seen corresponding path program 1 times [2019-12-28 03:57:35,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:35,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606880674] [2019-12-28 03:57:35,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:35,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606880674] [2019-12-28 03:57:35,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:35,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:57:35,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [31749433] [2019-12-28 03:57:35,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:35,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:35,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-28 03:57:35,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:35,874 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:35,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:57:35,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:35,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:57:35,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:57:35,878 INFO L87 Difference]: Start difference. First operand 16179 states and 37959 transitions. Second operand 3 states. [2019-12-28 03:57:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:35,982 INFO L93 Difference]: Finished difference Result 19210 states and 44947 transitions. [2019-12-28 03:57:35,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:57:35,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-12-28 03:57:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:36,015 INFO L225 Difference]: With dead ends: 19210 [2019-12-28 03:57:36,016 INFO L226 Difference]: Without dead ends: 19210 [2019-12-28 03:57:36,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:57:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-12-28 03:57:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19128. [2019-12-28 03:57:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19128 states. [2019-12-28 03:57:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19128 states to 19128 states and 44769 transitions. [2019-12-28 03:57:36,429 INFO L78 Accepts]: Start accepts. Automaton has 19128 states and 44769 transitions. Word has length 102 [2019-12-28 03:57:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:36,429 INFO L462 AbstractCegarLoop]: Abstraction has 19128 states and 44769 transitions. [2019-12-28 03:57:36,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:57:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 19128 states and 44769 transitions. [2019-12-28 03:57:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:36,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:36,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:36,458 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash 691844199, now seen corresponding path program 1 times [2019-12-28 03:57:36,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:36,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070759445] [2019-12-28 03:57:36,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:36,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070759445] [2019-12-28 03:57:36,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:36,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:57:36,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [906636816] [2019-12-28 03:57:36,573 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:36,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:36,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 208 transitions. [2019-12-28 03:57:36,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:36,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:57:36,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:57:36,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:36,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:57:36,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:57:36,713 INFO L87 Difference]: Start difference. First operand 19128 states and 44769 transitions. Second operand 4 states. [2019-12-28 03:57:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:37,056 INFO L93 Difference]: Finished difference Result 19746 states and 46070 transitions. [2019-12-28 03:57:37,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:57:37,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-28 03:57:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:37,087 INFO L225 Difference]: With dead ends: 19746 [2019-12-28 03:57:37,088 INFO L226 Difference]: Without dead ends: 19746 [2019-12-28 03:57:37,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:57:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19746 states. [2019-12-28 03:57:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19746 to 18480. [2019-12-28 03:57:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18480 states. [2019-12-28 03:57:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18480 states to 18480 states and 43313 transitions. [2019-12-28 03:57:37,421 INFO L78 Accepts]: Start accepts. Automaton has 18480 states and 43313 transitions. Word has length 102 [2019-12-28 03:57:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:37,421 INFO L462 AbstractCegarLoop]: Abstraction has 18480 states and 43313 transitions. [2019-12-28 03:57:37,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:57:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18480 states and 43313 transitions. [2019-12-28 03:57:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:37,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:37,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:37,445 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:37,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1045304609, now seen corresponding path program 2 times [2019-12-28 03:57:37,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:37,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940075963] [2019-12-28 03:57:37,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:37,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940075963] [2019-12-28 03:57:37,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:37,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:57:37,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894662061] [2019-12-28 03:57:37,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:37,663 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:37,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 308 transitions. [2019-12-28 03:57:37,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:37,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:57:37,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:57:37,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:37,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:57:37,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:57:37,778 INFO L87 Difference]: Start difference. First operand 18480 states and 43313 transitions. Second operand 5 states. [2019-12-28 03:57:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:38,213 INFO L93 Difference]: Finished difference Result 19900 states and 46310 transitions. [2019-12-28 03:57:38,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:57:38,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-12-28 03:57:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:38,235 INFO L225 Difference]: With dead ends: 19900 [2019-12-28 03:57:38,235 INFO L226 Difference]: Without dead ends: 19900 [2019-12-28 03:57:38,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:57:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19900 states. [2019-12-28 03:57:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19900 to 18448. [2019-12-28 03:57:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18448 states. [2019-12-28 03:57:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 43181 transitions. [2019-12-28 03:57:38,444 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 43181 transitions. Word has length 102 [2019-12-28 03:57:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:38,444 INFO L462 AbstractCegarLoop]: Abstraction has 18448 states and 43181 transitions. [2019-12-28 03:57:38,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:57:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 43181 transitions. [2019-12-28 03:57:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:38,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:38,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:38,462 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:38,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1752276477, now seen corresponding path program 3 times [2019-12-28 03:57:38,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:38,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330821091] [2019-12-28 03:57:38,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:38,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330821091] [2019-12-28 03:57:38,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:38,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:57:38,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [230469582] [2019-12-28 03:57:38,549 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:38,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:38,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 312 transitions. [2019-12-28 03:57:38,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:38,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:57:38,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:57:38,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:38,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:57:38,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:38,701 INFO L87 Difference]: Start difference. First operand 18448 states and 43181 transitions. Second operand 7 states. [2019-12-28 03:57:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:39,237 INFO L93 Difference]: Finished difference Result 22265 states and 51941 transitions. [2019-12-28 03:57:39,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:57:39,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-28 03:57:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:39,264 INFO L225 Difference]: With dead ends: 22265 [2019-12-28 03:57:39,264 INFO L226 Difference]: Without dead ends: 22265 [2019-12-28 03:57:39,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:57:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22265 states. [2019-12-28 03:57:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22265 to 18447. [2019-12-28 03:57:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-28 03:57:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 43157 transitions. [2019-12-28 03:57:39,639 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 43157 transitions. Word has length 102 [2019-12-28 03:57:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:39,639 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 43157 transitions. [2019-12-28 03:57:39,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:57:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 43157 transitions. [2019-12-28 03:57:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-28 03:57:39,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:39,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:39,657 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:39,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1928272137, now seen corresponding path program 4 times [2019-12-28 03:57:39,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:39,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817145841] [2019-12-28 03:57:39,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:39,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817145841] [2019-12-28 03:57:39,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:39,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:57:39,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441878552] [2019-12-28 03:57:39,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:39,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:39,857 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 244 transitions. [2019-12-28 03:57:39,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:39,876 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:57:39,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:57:39,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:39,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:57:39,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:57:39,877 INFO L87 Difference]: Start difference. First operand 18447 states and 43157 transitions. Second operand 6 states. [2019-12-28 03:57:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:40,189 INFO L93 Difference]: Finished difference Result 20480 states and 47302 transitions. [2019-12-28 03:57:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:57:40,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-12-28 03:57:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:40,210 INFO L225 Difference]: With dead ends: 20480 [2019-12-28 03:57:40,211 INFO L226 Difference]: Without dead ends: 20480 [2019-12-28 03:57:40,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20480 states. [2019-12-28 03:57:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20480 to 18602. [2019-12-28 03:57:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18602 states. [2019-12-28 03:57:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18602 states to 18602 states and 43465 transitions. [2019-12-28 03:57:40,422 INFO L78 Accepts]: Start accepts. Automaton has 18602 states and 43465 transitions. Word has length 102 [2019-12-28 03:57:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:40,422 INFO L462 AbstractCegarLoop]: Abstraction has 18602 states and 43465 transitions. [2019-12-28 03:57:40,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:57:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 18602 states and 43465 transitions. [2019-12-28 03:57:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-28 03:57:40,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:40,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:40,441 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash -279356980, now seen corresponding path program 1 times [2019-12-28 03:57:40,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:40,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484073775] [2019-12-28 03:57:40,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:40,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484073775] [2019-12-28 03:57:40,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:40,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-28 03:57:40,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [804784977] [2019-12-28 03:57:40,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:40,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:40,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 214 transitions. [2019-12-28 03:57:40,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:40,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:57:40,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 03:57:40,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:40,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 03:57:40,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:57:40,850 INFO L87 Difference]: Start difference. First operand 18602 states and 43465 transitions. Second operand 12 states. [2019-12-28 03:57:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:41,580 INFO L93 Difference]: Finished difference Result 41077 states and 95242 transitions. [2019-12-28 03:57:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-28 03:57:41,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-12-28 03:57:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:41,623 INFO L225 Difference]: With dead ends: 41077 [2019-12-28 03:57:41,623 INFO L226 Difference]: Without dead ends: 32582 [2019-12-28 03:57:41,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-12-28 03:57:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32582 states. [2019-12-28 03:57:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32582 to 24570. [2019-12-28 03:57:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24570 states. [2019-12-28 03:57:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24570 states to 24570 states and 57366 transitions. [2019-12-28 03:57:42,100 INFO L78 Accepts]: Start accepts. Automaton has 24570 states and 57366 transitions. Word has length 104 [2019-12-28 03:57:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:42,100 INFO L462 AbstractCegarLoop]: Abstraction has 24570 states and 57366 transitions. [2019-12-28 03:57:42,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 03:57:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 24570 states and 57366 transitions. [2019-12-28 03:57:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-28 03:57:42,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:42,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:42,127 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1718959178, now seen corresponding path program 2 times [2019-12-28 03:57:42,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:42,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863137195] [2019-12-28 03:57:42,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:42,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863137195] [2019-12-28 03:57:42,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:42,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-28 03:57:42,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111374504] [2019-12-28 03:57:42,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:42,357 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:42,459 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 214 transitions. [2019-12-28 03:57:42,459 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:42,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:57:42,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 03:57:42,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:42,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 03:57:42,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:57:42,461 INFO L87 Difference]: Start difference. First operand 24570 states and 57366 transitions. Second operand 12 states. [2019-12-28 03:57:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:43,380 INFO L93 Difference]: Finished difference Result 47878 states and 110787 transitions. [2019-12-28 03:57:43,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 03:57:43,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-12-28 03:57:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:43,430 INFO L225 Difference]: With dead ends: 47878 [2019-12-28 03:57:43,430 INFO L226 Difference]: Without dead ends: 44374 [2019-12-28 03:57:43,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-12-28 03:57:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44374 states. [2019-12-28 03:57:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44374 to 29419. [2019-12-28 03:57:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29419 states. [2019-12-28 03:57:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29419 states to 29419 states and 68821 transitions. [2019-12-28 03:57:43,842 INFO L78 Accepts]: Start accepts. Automaton has 29419 states and 68821 transitions. Word has length 104 [2019-12-28 03:57:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:43,842 INFO L462 AbstractCegarLoop]: Abstraction has 29419 states and 68821 transitions. [2019-12-28 03:57:43,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 03:57:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29419 states and 68821 transitions. [2019-12-28 03:57:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-28 03:57:43,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:43,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:43,871 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:43,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash -42251132, now seen corresponding path program 1 times [2019-12-28 03:57:43,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:43,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169238887] [2019-12-28 03:57:43,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:44,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169238887] [2019-12-28 03:57:44,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:44,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-28 03:57:44,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850871229] [2019-12-28 03:57:44,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:44,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:44,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 294 transitions. [2019-12-28 03:57:44,316 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:44,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-28 03:57:44,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-28 03:57:44,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:44,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-28 03:57:44,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-12-28 03:57:44,568 INFO L87 Difference]: Start difference. First operand 29419 states and 68821 transitions. Second operand 18 states. [2019-12-28 03:57:45,610 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-28 03:57:46,538 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-28 03:57:46,683 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-28 03:57:47,123 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-28 03:57:47,688 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-28 03:57:49,305 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-28 03:57:51,811 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-28 03:57:52,950 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-28 03:57:53,290 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-28 03:57:53,579 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-12-28 03:57:53,742 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-28 03:57:54,284 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-28 03:57:55,322 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-28 03:57:55,485 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-28 03:57:55,836 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-12-28 03:57:56,143 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-28 03:57:56,457 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-12-28 03:57:56,635 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-12-28 03:57:56,817 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-28 03:57:58,950 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-28 03:57:59,094 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-28 03:57:59,271 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-12-28 03:57:59,963 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-12-28 03:58:04,179 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-28 03:58:05,358 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-12-28 03:58:07,441 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-28 03:58:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:58:07,950 INFO L93 Difference]: Finished difference Result 101910 states and 233609 transitions. [2019-12-28 03:58:07,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-12-28 03:58:07,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 104 [2019-12-28 03:58:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:58:08,048 INFO L225 Difference]: With dead ends: 101910 [2019-12-28 03:58:08,048 INFO L226 Difference]: Without dead ends: 92111 [2019-12-28 03:58:08,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9236 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2408, Invalid=22398, Unknown=0, NotChecked=0, Total=24806 [2019-12-28 03:58:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92111 states. [2019-12-28 03:58:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92111 to 36881. [2019-12-28 03:58:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36881 states. [2019-12-28 03:58:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36881 states to 36881 states and 86207 transitions. [2019-12-28 03:58:08,927 INFO L78 Accepts]: Start accepts. Automaton has 36881 states and 86207 transitions. Word has length 104 [2019-12-28 03:58:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:58:08,927 INFO L462 AbstractCegarLoop]: Abstraction has 36881 states and 86207 transitions. [2019-12-28 03:58:08,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-28 03:58:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 36881 states and 86207 transitions. [2019-12-28 03:58:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-28 03:58:08,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:58:08,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:58:08,963 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:58:08,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:58:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash 715953972, now seen corresponding path program 2 times [2019-12-28 03:58:08,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:58:08,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739039570] [2019-12-28 03:58:08,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:58:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:58:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:58:09,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739039570] [2019-12-28 03:58:09,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:58:09,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:58:09,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [94845987] [2019-12-28 03:58:09,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:58:09,089 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:58:09,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 238 transitions. [2019-12-28 03:58:09,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:58:09,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 03:58:09,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:58:09,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:58:09,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:58:09,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:58:09,229 INFO L87 Difference]: Start difference. First operand 36881 states and 86207 transitions. Second operand 9 states. [2019-12-28 03:58:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:58:09,649 INFO L93 Difference]: Finished difference Result 38221 states and 89186 transitions. [2019-12-28 03:58:09,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:58:09,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-12-28 03:58:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:58:09,655 INFO L225 Difference]: With dead ends: 38221 [2019-12-28 03:58:09,656 INFO L226 Difference]: Without dead ends: 3992 [2019-12-28 03:58:09,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:58:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3992 states. [2019-12-28 03:58:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3992 to 3422. [2019-12-28 03:58:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3422 states. [2019-12-28 03:58:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 7958 transitions. [2019-12-28 03:58:09,693 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 7958 transitions. Word has length 104 [2019-12-28 03:58:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:58:09,693 INFO L462 AbstractCegarLoop]: Abstraction has 3422 states and 7958 transitions. [2019-12-28 03:58:09,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:58:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 7958 transitions. [2019-12-28 03:58:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-28 03:58:09,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:58:09,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:58:09,696 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:58:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:58:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1669148943, now seen corresponding path program 1 times [2019-12-28 03:58:09,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:58:09,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791800277] [2019-12-28 03:58:09,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:58:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:58:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:58:09,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791800277] [2019-12-28 03:58:09,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:58:09,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:58:09,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1666371959] [2019-12-28 03:58:09,766 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:58:09,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:58:09,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 186 transitions. [2019-12-28 03:58:09,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:58:09,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:58:09,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:58:09,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:58:09,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:58:09,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:58:09,924 INFO L87 Difference]: Start difference. First operand 3422 states and 7958 transitions. Second operand 7 states. [2019-12-28 03:58:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:58:10,850 INFO L93 Difference]: Finished difference Result 4662 states and 10680 transitions. [2019-12-28 03:58:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:58:10,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-12-28 03:58:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:58:10,857 INFO L225 Difference]: With dead ends: 4662 [2019-12-28 03:58:10,857 INFO L226 Difference]: Without dead ends: 4640 [2019-12-28 03:58:10,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:58:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2019-12-28 03:58:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 3474. [2019-12-28 03:58:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3474 states. [2019-12-28 03:58:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 8074 transitions. [2019-12-28 03:58:10,897 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 8074 transitions. Word has length 104 [2019-12-28 03:58:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:58:10,898 INFO L462 AbstractCegarLoop]: Abstraction has 3474 states and 8074 transitions. [2019-12-28 03:58:10,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:58:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 8074 transitions. [2019-12-28 03:58:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-28 03:58:10,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:58:10,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:58:10,901 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:58:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:58:10,901 INFO L82 PathProgramCache]: Analyzing trace with hash 191962205, now seen corresponding path program 1 times [2019-12-28 03:58:10,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:58:10,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774123749] [2019-12-28 03:58:10,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:58:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:58:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:58:11,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774123749] [2019-12-28 03:58:11,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:58:11,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:58:11,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1299220995] [2019-12-28 03:58:11,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:58:11,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:58:11,158 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 186 transitions. [2019-12-28 03:58:11,158 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:58:11,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:58:11,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 03:58:11,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:58:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 03:58:11,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:58:11,209 INFO L87 Difference]: Start difference. First operand 3474 states and 8074 transitions. Second operand 12 states. [2019-12-28 03:58:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:58:12,478 INFO L93 Difference]: Finished difference Result 4882 states and 10991 transitions. [2019-12-28 03:58:12,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:58:12,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-12-28 03:58:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:58:12,485 INFO L225 Difference]: With dead ends: 4882 [2019-12-28 03:58:12,485 INFO L226 Difference]: Without dead ends: 4882 [2019-12-28 03:58:12,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-28 03:58:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2019-12-28 03:58:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3624. [2019-12-28 03:58:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3624 states. [2019-12-28 03:58:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 8371 transitions. [2019-12-28 03:58:12,529 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 8371 transitions. Word has length 104 [2019-12-28 03:58:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:58:12,529 INFO L462 AbstractCegarLoop]: Abstraction has 3624 states and 8371 transitions. [2019-12-28 03:58:12,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 03:58:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 8371 transitions. [2019-12-28 03:58:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-28 03:58:12,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:58:12,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:58:12,533 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:58:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:58:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1079465886, now seen corresponding path program 1 times [2019-12-28 03:58:12,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:58:12,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551369008] [2019-12-28 03:58:12,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:58:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:58:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:58:12,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551369008] [2019-12-28 03:58:12,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:58:12,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:58:12,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014161788] [2019-12-28 03:58:12,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:58:12,694 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:58:12,768 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 186 transitions. [2019-12-28 03:58:12,768 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:58:12,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:58:12,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:58:12,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:58:12,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:58:12,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:58:12,769 INFO L87 Difference]: Start difference. First operand 3624 states and 8371 transitions. Second operand 7 states. [2019-12-28 03:58:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:58:13,153 INFO L93 Difference]: Finished difference Result 3999 states and 9125 transitions. [2019-12-28 03:58:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:58:13,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-12-28 03:58:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:58:13,159 INFO L225 Difference]: With dead ends: 3999 [2019-12-28 03:58:13,160 INFO L226 Difference]: Without dead ends: 3999 [2019-12-28 03:58:13,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:58:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2019-12-28 03:58:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3564. [2019-12-28 03:58:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-12-28 03:58:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 8249 transitions. [2019-12-28 03:58:13,197 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 8249 transitions. Word has length 104 [2019-12-28 03:58:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:58:13,197 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 8249 transitions. [2019-12-28 03:58:13,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:58:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 8249 transitions. [2019-12-28 03:58:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-28 03:58:13,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:58:13,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:58:13,201 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:58:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:58:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1562239622, now seen corresponding path program 1 times [2019-12-28 03:58:13,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:58:13,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076233136] [2019-12-28 03:58:13,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:58:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:58:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:58:13,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076233136] [2019-12-28 03:58:13,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:58:13,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:58:13,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967750552] [2019-12-28 03:58:13,359 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:58:13,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:58:13,457 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 200 transitions. [2019-12-28 03:58:13,457 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:58:13,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:58:13,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:58:13,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:58:13,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:58:13,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:58:13,543 INFO L87 Difference]: Start difference. First operand 3564 states and 8249 transitions. Second operand 11 states. Received shutdown request... [2019-12-28 03:58:14,720 WARN L209 SmtUtils]: Removed 2 from assertion stack [2019-12-28 03:58:14,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:58:14,720 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-28 03:58:14,725 WARN L227 ceAbstractionStarter]: Timeout [2019-12-28 03:58:14,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:58:14 BasicIcfg [2019-12-28 03:58:14,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:58:14,727 INFO L168 Benchmark]: Toolchain (without parser) took 192075.79 ms. Allocated memory was 144.7 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 762.7 MB. Max. memory is 7.1 GB. [2019-12-28 03:58:14,727 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 03:58:14,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.05 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 153.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-28 03:58:14,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.93 ms. Allocated memory is still 201.9 MB. Free memory was 153.2 MB in the beginning and 149.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-28 03:58:14,728 INFO L168 Benchmark]: Boogie Preprocessor took 41.49 ms. Allocated memory is still 201.9 MB. Free memory was 149.7 MB in the beginning and 147.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:58:14,728 INFO L168 Benchmark]: RCFGBuilder took 1023.21 ms. Allocated memory is still 201.9 MB. Free memory was 147.7 MB in the beginning and 94.4 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. [2019-12-28 03:58:14,728 INFO L168 Benchmark]: TraceAbstraction took 190088.57 ms. Allocated memory was 201.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 93.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 698.8 MB. Max. memory is 7.1 GB. [2019-12-28 03:58:14,730 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.24 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.05 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 153.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.93 ms. Allocated memory is still 201.9 MB. Free memory was 153.2 MB in the beginning and 149.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.49 ms. Allocated memory is still 201.9 MB. Free memory was 149.7 MB in the beginning and 147.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1023.21 ms. Allocated memory is still 201.9 MB. Free memory was 147.7 MB in the beginning and 94.4 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190088.57 ms. Allocated memory was 201.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 93.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 698.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (3564states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 12ms.. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (3564states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 12ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: TIMEOUT, OverallTime: 189.8s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 74.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 14920 SDtfs, 26103 SDslu, 55047 SDs, 0 SdLazy, 27426 SolverSat, 1319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 226 SyntacticMatches, 23 SemanticMatches, 505 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10492 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222094occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 97.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 327367 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2792 NumberOfCodeBlocks, 2792 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2758 ConstructedInterpolants, 0 QuantifiedInterpolants, 650550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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