/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:41:00,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:41:00,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:41:00,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:41:00,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:41:00,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:41:00,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:41:00,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:41:00,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:41:00,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:41:00,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:41:00,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:41:00,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:41:00,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:41:00,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:41:00,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:41:00,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:41:00,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:41:00,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:41:00,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:41:00,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:41:00,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:41:00,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:41:00,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:41:00,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:41:00,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:41:00,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:41:00,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:41:00,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:41:00,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:41:00,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:41:00,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:41:00,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:41:00,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:41:00,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:41:00,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:41:00,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:41:00,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:41:00,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:41:00,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:41:00,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:41:00,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:41:00,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:41:00,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:41:00,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:41:00,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:41:00,423 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:41:00,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:41:00,424 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:41:00,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:41:00,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:41:00,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:41:00,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:41:00,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:41:00,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:41:00,427 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:41:00,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:41:00,427 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:41:00,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:41:00,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:41:00,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:41:00,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:41:00,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:41:00,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:41:00,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:41:00,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:41:00,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:41:00,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:41:00,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:41:00,429 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:41:00,430 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:41:00,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:41:00,431 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:41:00,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:41:00,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:41:00,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:41:00,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:41:00,748 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:41:00,748 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:41:00,749 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2019-12-27 20:41:00,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da6038d04/05ad0529d4a84bfeb6fa8a2dd3a17fce/FLAG51017013f [2019-12-27 20:41:01,364 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:41:01,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2019-12-27 20:41:01,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da6038d04/05ad0529d4a84bfeb6fa8a2dd3a17fce/FLAG51017013f [2019-12-27 20:41:01,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da6038d04/05ad0529d4a84bfeb6fa8a2dd3a17fce [2019-12-27 20:41:01,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:41:01,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:41:01,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:41:01,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:41:01,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:41:01,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:01" (1/1) ... [2019-12-27 20:41:01,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1562cfed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:01, skipping insertion in model container [2019-12-27 20:41:01,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:01" (1/1) ... [2019-12-27 20:41:01,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:41:01,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:41:02,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:41:02,303 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:41:02,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:41:02,447 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:41:02,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02 WrapperNode [2019-12-27 20:41:02,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:41:02,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:41:02,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:41:02,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:41:02,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... [2019-12-27 20:41:02,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... [2019-12-27 20:41:02,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:41:02,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:41:02,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:41:02,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:41:02,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... [2019-12-27 20:41:02,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... [2019-12-27 20:41:02,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... [2019-12-27 20:41:02,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... [2019-12-27 20:41:02,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... [2019-12-27 20:41:02,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... [2019-12-27 20:41:02,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... [2019-12-27 20:41:02,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:41:02,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:41:02,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:41:02,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:41:02,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:41:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:41:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:41:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:41:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:41:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:41:02,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:41:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:41:02,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:41:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:41:02,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:41:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 20:41:02,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 20:41:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:41:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:41:02,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:41:02,650 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:41:03,378 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:41:03,379 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:41:03,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:03 BoogieIcfgContainer [2019-12-27 20:41:03,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:41:03,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:41:03,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:41:03,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:41:03,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:41:01" (1/3) ... [2019-12-27 20:41:03,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f8e5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:03, skipping insertion in model container [2019-12-27 20:41:03,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:02" (2/3) ... [2019-12-27 20:41:03,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f8e5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:03, skipping insertion in model container [2019-12-27 20:41:03,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:03" (3/3) ... [2019-12-27 20:41:03,389 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_power.opt.i [2019-12-27 20:41:03,400 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:41:03,400 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:41:03,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:41:03,410 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:41:03,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,457 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,457 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,460 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,461 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,485 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,485 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,485 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,486 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,486 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,510 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,510 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,520 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,521 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,538 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,542 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:03,559 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 20:41:03,581 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:41:03,581 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:41:03,581 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:41:03,581 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:41:03,582 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:41:03,582 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:41:03,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:41:03,582 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:41:03,603 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 20:41:03,605 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 20:41:03,708 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 20:41:03,708 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:41:03,727 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:41:03,752 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 20:41:03,826 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 20:41:03,826 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:41:03,836 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:41:03,862 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 20:41:03,864 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:41:07,598 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 20:41:07,753 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 20:41:07,782 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78681 [2019-12-27 20:41:07,783 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 20:41:07,787 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-27 20:41:54,734 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 188550 states. [2019-12-27 20:41:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 188550 states. [2019-12-27 20:41:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:41:54,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:41:54,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:41:54,745 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:41:54,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:41:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1081112205, now seen corresponding path program 1 times [2019-12-27 20:41:54,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:41:54,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518349167] [2019-12-27 20:41:54,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:41:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:41:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:41:55,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518349167] [2019-12-27 20:41:55,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:41:55,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:41:55,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [359961526] [2019-12-27 20:41:55,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:41:55,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:41:55,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:41:55,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:41:55,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:41:55,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:41:55,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:41:55,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:41:55,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:41:55,063 INFO L87 Difference]: Start difference. First operand 188550 states. Second operand 3 states. [2019-12-27 20:42:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:42:00,299 INFO L93 Difference]: Finished difference Result 175078 states and 839564 transitions. [2019-12-27 20:42:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:42:00,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:42:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:42:01,492 INFO L225 Difference]: With dead ends: 175078 [2019-12-27 20:42:01,493 INFO L226 Difference]: Without dead ends: 164262 [2019-12-27 20:42:01,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:42:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164262 states. [2019-12-27 20:42:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164262 to 164262. [2019-12-27 20:42:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164262 states. [2019-12-27 20:42:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164262 states to 164262 states and 786680 transitions. [2019-12-27 20:42:17,516 INFO L78 Accepts]: Start accepts. Automaton has 164262 states and 786680 transitions. Word has length 7 [2019-12-27 20:42:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:42:17,517 INFO L462 AbstractCegarLoop]: Abstraction has 164262 states and 786680 transitions. [2019-12-27 20:42:17,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:42:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 164262 states and 786680 transitions. [2019-12-27 20:42:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:42:17,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:42:17,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:42:17,532 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:42:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:42:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -983624590, now seen corresponding path program 1 times [2019-12-27 20:42:17,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:42:17,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726909078] [2019-12-27 20:42:17,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:42:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:42:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:42:17,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726909078] [2019-12-27 20:42:17,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:42:17,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:42:17,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1428812393] [2019-12-27 20:42:17,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:42:17,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:42:17,743 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:42:17,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:42:17,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:42:17,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:42:17,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:42:17,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:42:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:42:17,746 INFO L87 Difference]: Start difference. First operand 164262 states and 786680 transitions. Second operand 4 states. [2019-12-27 20:42:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:42:25,872 INFO L93 Difference]: Finished difference Result 260206 states and 1199142 transitions. [2019-12-27 20:42:25,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:42:25,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 20:42:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:42:27,922 INFO L225 Difference]: With dead ends: 260206 [2019-12-27 20:42:27,922 INFO L226 Difference]: Without dead ends: 259982 [2019-12-27 20:42:27,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:42:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259982 states. [2019-12-27 20:42:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259982 to 241474. [2019-12-27 20:42:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241474 states. [2019-12-27 20:42:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241474 states to 241474 states and 1122210 transitions. [2019-12-27 20:42:58,014 INFO L78 Accepts]: Start accepts. Automaton has 241474 states and 1122210 transitions. Word has length 15 [2019-12-27 20:42:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:42:58,014 INFO L462 AbstractCegarLoop]: Abstraction has 241474 states and 1122210 transitions. [2019-12-27 20:42:58,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:42:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 241474 states and 1122210 transitions. [2019-12-27 20:42:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:42:58,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:42:58,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:42:58,020 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:42:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:42:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1733643067, now seen corresponding path program 1 times [2019-12-27 20:42:58,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:42:58,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518735813] [2019-12-27 20:42:58,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:42:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:42:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:42:58,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518735813] [2019-12-27 20:42:58,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:42:58,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:42:58,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1266024207] [2019-12-27 20:42:58,086 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:42:58,090 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:42:58,092 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:42:58,092 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:42:58,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:42:58,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:42:58,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:42:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:42:58,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:42:58,094 INFO L87 Difference]: Start difference. First operand 241474 states and 1122210 transitions. Second operand 3 states. [2019-12-27 20:42:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:42:58,886 INFO L93 Difference]: Finished difference Result 150344 states and 629507 transitions. [2019-12-27 20:42:58,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:42:58,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 20:42:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:42:59,408 INFO L225 Difference]: With dead ends: 150344 [2019-12-27 20:42:59,408 INFO L226 Difference]: Without dead ends: 150344 [2019-12-27 20:42:59,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:43:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150344 states. [2019-12-27 20:43:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150344 to 150344. [2019-12-27 20:43:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150344 states. [2019-12-27 20:43:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150344 states to 150344 states and 629507 transitions. [2019-12-27 20:43:16,156 INFO L78 Accepts]: Start accepts. Automaton has 150344 states and 629507 transitions. Word has length 15 [2019-12-27 20:43:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:16,157 INFO L462 AbstractCegarLoop]: Abstraction has 150344 states and 629507 transitions. [2019-12-27 20:43:16,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:43:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 150344 states and 629507 transitions. [2019-12-27 20:43:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:43:16,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:16,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:16,163 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:16,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:16,163 INFO L82 PathProgramCache]: Analyzing trace with hash 763013226, now seen corresponding path program 1 times [2019-12-27 20:43:16,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:16,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829633707] [2019-12-27 20:43:16,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:16,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829633707] [2019-12-27 20:43:16,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:16,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:43:16,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896192716] [2019-12-27 20:43:16,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:16,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:16,223 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 20:43:16,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:16,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:43:16,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:43:16,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:43:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:43:16,269 INFO L87 Difference]: Start difference. First operand 150344 states and 629507 transitions. Second operand 5 states. [2019-12-27 20:43:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:16,496 INFO L93 Difference]: Finished difference Result 41318 states and 147207 transitions. [2019-12-27 20:43:16,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:43:16,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:43:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:16,575 INFO L225 Difference]: With dead ends: 41318 [2019-12-27 20:43:16,575 INFO L226 Difference]: Without dead ends: 41318 [2019-12-27 20:43:16,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:43:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41318 states. [2019-12-27 20:43:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41318 to 41318. [2019-12-27 20:43:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41318 states. [2019-12-27 20:43:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41318 states to 41318 states and 147207 transitions. [2019-12-27 20:43:22,210 INFO L78 Accepts]: Start accepts. Automaton has 41318 states and 147207 transitions. Word has length 16 [2019-12-27 20:43:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:22,210 INFO L462 AbstractCegarLoop]: Abstraction has 41318 states and 147207 transitions. [2019-12-27 20:43:22,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:43:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 41318 states and 147207 transitions. [2019-12-27 20:43:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:43:22,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:22,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:22,213 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:22,214 INFO L82 PathProgramCache]: Analyzing trace with hash -613707051, now seen corresponding path program 1 times [2019-12-27 20:43:22,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:22,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065605559] [2019-12-27 20:43:22,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:22,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065605559] [2019-12-27 20:43:22,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:22,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:43:22,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [782543681] [2019-12-27 20:43:22,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:22,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:22,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:43:22,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:22,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:43:22,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:43:22,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:43:22,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:43:22,423 INFO L87 Difference]: Start difference. First operand 41318 states and 147207 transitions. Second operand 7 states. [2019-12-27 20:43:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:23,294 INFO L93 Difference]: Finished difference Result 59208 states and 207429 transitions. [2019-12-27 20:43:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:43:23,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 20:43:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:23,409 INFO L225 Difference]: With dead ends: 59208 [2019-12-27 20:43:23,409 INFO L226 Difference]: Without dead ends: 59190 [2019-12-27 20:43:23,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:43:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59190 states. [2019-12-27 20:43:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59190 to 47448. [2019-12-27 20:43:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47448 states. [2019-12-27 20:43:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47448 states to 47448 states and 168412 transitions. [2019-12-27 20:43:24,714 INFO L78 Accepts]: Start accepts. Automaton has 47448 states and 168412 transitions. Word has length 16 [2019-12-27 20:43:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:24,715 INFO L462 AbstractCegarLoop]: Abstraction has 47448 states and 168412 transitions. [2019-12-27 20:43:24,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:43:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 47448 states and 168412 transitions. [2019-12-27 20:43:24,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 20:43:24,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:24,734 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] [2019-12-27 20:43:24,734 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:24,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash -671023088, now seen corresponding path program 1 times [2019-12-27 20:43:24,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:24,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102825310] [2019-12-27 20:43:24,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:24,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102825310] [2019-12-27 20:43:24,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:24,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:43:24,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1804219061] [2019-12-27 20:43:24,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:24,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:24,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 100 transitions. [2019-12-27 20:43:24,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:25,062 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:43:25,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:43:25,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:25,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:43:25,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:43:25,063 INFO L87 Difference]: Start difference. First operand 47448 states and 168412 transitions. Second operand 8 states. [2019-12-27 20:43:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:27,632 INFO L93 Difference]: Finished difference Result 144690 states and 501529 transitions. [2019-12-27 20:43:27,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:43:27,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 20:43:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:27,964 INFO L225 Difference]: With dead ends: 144690 [2019-12-27 20:43:27,964 INFO L226 Difference]: Without dead ends: 144637 [2019-12-27 20:43:27,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:43:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144637 states. [2019-12-27 20:43:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144637 to 70302. [2019-12-27 20:43:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70302 states. [2019-12-27 20:43:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70302 states to 70302 states and 249360 transitions. [2019-12-27 20:43:30,419 INFO L78 Accepts]: Start accepts. Automaton has 70302 states and 249360 transitions. Word has length 24 [2019-12-27 20:43:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:30,419 INFO L462 AbstractCegarLoop]: Abstraction has 70302 states and 249360 transitions. [2019-12-27 20:43:30,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:43:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 70302 states and 249360 transitions. [2019-12-27 20:43:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 20:43:30,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:30,443 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] [2019-12-27 20:43:30,443 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1655550286, now seen corresponding path program 2 times [2019-12-27 20:43:30,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:30,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019821915] [2019-12-27 20:43:30,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:30,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019821915] [2019-12-27 20:43:30,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:30,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:43:30,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [638594593] [2019-12-27 20:43:30,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:30,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:30,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 40 transitions. [2019-12-27 20:43:30,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:30,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:43:30,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:43:30,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:43:30,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:43:30,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:43:30,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:43:30,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:43:30,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:43:30,708 INFO L87 Difference]: Start difference. First operand 70302 states and 249360 transitions. Second operand 10 states. [2019-12-27 20:43:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:33,697 INFO L93 Difference]: Finished difference Result 127573 states and 440756 transitions. [2019-12-27 20:43:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:43:33,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-27 20:43:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:33,968 INFO L225 Difference]: With dead ends: 127573 [2019-12-27 20:43:33,968 INFO L226 Difference]: Without dead ends: 127539 [2019-12-27 20:43:33,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:43:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127539 states. [2019-12-27 20:43:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127539 to 68426. [2019-12-27 20:43:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68426 states. [2019-12-27 20:43:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68426 states to 68426 states and 243998 transitions. [2019-12-27 20:43:36,229 INFO L78 Accepts]: Start accepts. Automaton has 68426 states and 243998 transitions. Word has length 24 [2019-12-27 20:43:36,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:36,229 INFO L462 AbstractCegarLoop]: Abstraction has 68426 states and 243998 transitions. [2019-12-27 20:43:36,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:43:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 68426 states and 243998 transitions. [2019-12-27 20:43:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:43:36,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:36,270 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] [2019-12-27 20:43:36,270 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:36,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash -477366327, now seen corresponding path program 1 times [2019-12-27 20:43:36,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:36,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620690266] [2019-12-27 20:43:36,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:36,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620690266] [2019-12-27 20:43:36,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:36,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:43:36,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [131531953] [2019-12-27 20:43:36,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:36,339 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:36,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 20:43:36,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:36,361 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:43:36,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:43:36,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:36,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:43:36,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:43:36,362 INFO L87 Difference]: Start difference. First operand 68426 states and 243998 transitions. Second operand 6 states. [2019-12-27 20:43:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:36,560 INFO L93 Difference]: Finished difference Result 39073 states and 141657 transitions. [2019-12-27 20:43:36,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:43:36,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 20:43:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:36,635 INFO L225 Difference]: With dead ends: 39073 [2019-12-27 20:43:36,635 INFO L226 Difference]: Without dead ends: 39073 [2019-12-27 20:43:36,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:43:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39073 states. [2019-12-27 20:43:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39073 to 37795. [2019-12-27 20:43:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37795 states. [2019-12-27 20:43:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37795 states to 37795 states and 137104 transitions. [2019-12-27 20:43:37,893 INFO L78 Accepts]: Start accepts. Automaton has 37795 states and 137104 transitions. Word has length 28 [2019-12-27 20:43:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:37,893 INFO L462 AbstractCegarLoop]: Abstraction has 37795 states and 137104 transitions. [2019-12-27 20:43:37,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:43:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37795 states and 137104 transitions. [2019-12-27 20:43:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:43:37,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:37,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:37,954 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash -574356162, now seen corresponding path program 1 times [2019-12-27 20:43:37,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:37,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908188386] [2019-12-27 20:43:37,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:38,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908188386] [2019-12-27 20:43:38,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:38,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:43:38,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1446506495] [2019-12-27 20:43:38,020 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:38,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:38,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 160 transitions. [2019-12-27 20:43:38,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:38,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:43:38,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:43:38,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:38,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:43:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:43:38,079 INFO L87 Difference]: Start difference. First operand 37795 states and 137104 transitions. Second operand 4 states. [2019-12-27 20:43:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:38,299 INFO L93 Difference]: Finished difference Result 56982 states and 197218 transitions. [2019-12-27 20:43:38,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:43:38,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 20:43:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:38,367 INFO L225 Difference]: With dead ends: 56982 [2019-12-27 20:43:38,367 INFO L226 Difference]: Without dead ends: 38430 [2019-12-27 20:43:38,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:43:38,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38430 states. [2019-12-27 20:43:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38430 to 37152. [2019-12-27 20:43:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37152 states. [2019-12-27 20:43:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37152 states to 37152 states and 117700 transitions. [2019-12-27 20:43:38,995 INFO L78 Accepts]: Start accepts. Automaton has 37152 states and 117700 transitions. Word has length 42 [2019-12-27 20:43:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:38,995 INFO L462 AbstractCegarLoop]: Abstraction has 37152 states and 117700 transitions. [2019-12-27 20:43:38,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:43:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 37152 states and 117700 transitions. [2019-12-27 20:43:39,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 20:43:39,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:39,047 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] [2019-12-27 20:43:39,047 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:39,048 INFO L82 PathProgramCache]: Analyzing trace with hash -842084234, now seen corresponding path program 1 times [2019-12-27 20:43:39,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:39,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454374780] [2019-12-27 20:43:39,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:39,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454374780] [2019-12-27 20:43:39,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:39,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:43:39,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9593385] [2019-12-27 20:43:39,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:39,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:39,217 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 261 transitions. [2019-12-27 20:43:39,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:39,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:43:39,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:43:39,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:43:39,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:43:39,244 INFO L87 Difference]: Start difference. First operand 37152 states and 117700 transitions. Second operand 8 states. [2019-12-27 20:43:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:39,487 INFO L93 Difference]: Finished difference Result 35635 states and 113790 transitions. [2019-12-27 20:43:39,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:43:39,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-12-27 20:43:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:39,518 INFO L225 Difference]: With dead ends: 35635 [2019-12-27 20:43:39,518 INFO L226 Difference]: Without dead ends: 18523 [2019-12-27 20:43:39,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:43:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18523 states. [2019-12-27 20:43:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18523 to 17391. [2019-12-27 20:43:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17391 states. [2019-12-27 20:43:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17391 states to 17391 states and 55406 transitions. [2019-12-27 20:43:40,028 INFO L78 Accepts]: Start accepts. Automaton has 17391 states and 55406 transitions. Word has length 43 [2019-12-27 20:43:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:40,028 INFO L462 AbstractCegarLoop]: Abstraction has 17391 states and 55406 transitions. [2019-12-27 20:43:40,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:43:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 17391 states and 55406 transitions. [2019-12-27 20:43:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:40,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:40,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:40,056 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash 26533346, now seen corresponding path program 1 times [2019-12-27 20:43:40,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:40,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234044922] [2019-12-27 20:43:40,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:40,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234044922] [2019-12-27 20:43:40,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:40,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:43:40,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1124525337] [2019-12-27 20:43:40,123 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:40,141 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:40,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 241 states and 405 transitions. [2019-12-27 20:43:40,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:40,338 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:43:40,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:43:40,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:43:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:43:40,340 INFO L87 Difference]: Start difference. First operand 17391 states and 55406 transitions. Second operand 4 states. [2019-12-27 20:43:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:40,450 INFO L93 Difference]: Finished difference Result 21741 states and 67992 transitions. [2019-12-27 20:43:40,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:43:40,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 20:43:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:40,482 INFO L225 Difference]: With dead ends: 21741 [2019-12-27 20:43:40,482 INFO L226 Difference]: Without dead ends: 21741 [2019-12-27 20:43:40,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:43:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21741 states. [2019-12-27 20:43:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21741 to 14603. [2019-12-27 20:43:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14603 states. [2019-12-27 20:43:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14603 states to 14603 states and 45746 transitions. [2019-12-27 20:43:40,778 INFO L78 Accepts]: Start accepts. Automaton has 14603 states and 45746 transitions. Word has length 57 [2019-12-27 20:43:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:40,778 INFO L462 AbstractCegarLoop]: Abstraction has 14603 states and 45746 transitions. [2019-12-27 20:43:40,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:43:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 45746 transitions. [2019-12-27 20:43:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:40,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:40,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:40,797 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:40,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:40,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1203985163, now seen corresponding path program 1 times [2019-12-27 20:43:40,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:40,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263424775] [2019-12-27 20:43:40,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:40,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263424775] [2019-12-27 20:43:40,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:40,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:43:40,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [478385741] [2019-12-27 20:43:40,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:40,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:41,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 241 states and 405 transitions. [2019-12-27 20:43:41,208 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:41,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:43:41,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:43:41,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:43:41,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:43:41,224 INFO L87 Difference]: Start difference. First operand 14603 states and 45746 transitions. Second operand 5 states. [2019-12-27 20:43:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:41,330 INFO L93 Difference]: Finished difference Result 26589 states and 83289 transitions. [2019-12-27 20:43:41,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:43:41,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 20:43:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:41,352 INFO L225 Difference]: With dead ends: 26589 [2019-12-27 20:43:41,352 INFO L226 Difference]: Without dead ends: 12334 [2019-12-27 20:43:41,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-27 20:43:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12334 states. [2019-12-27 20:43:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12334 to 12334. [2019-12-27 20:43:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12334 states. [2019-12-27 20:43:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12334 states to 12334 states and 38509 transitions. [2019-12-27 20:43:41,574 INFO L78 Accepts]: Start accepts. Automaton has 12334 states and 38509 transitions. Word has length 57 [2019-12-27 20:43:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:41,574 INFO L462 AbstractCegarLoop]: Abstraction has 12334 states and 38509 transitions. [2019-12-27 20:43:41,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:43:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 12334 states and 38509 transitions. [2019-12-27 20:43:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:41,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:41,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] [2019-12-27 20:43:41,591 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:41,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash -639237961, now seen corresponding path program 2 times [2019-12-27 20:43:41,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:41,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58950512] [2019-12-27 20:43:41,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:41,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58950512] [2019-12-27 20:43:41,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:41,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:43:41,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300992696] [2019-12-27 20:43:41,693 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:41,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:42,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 377 states and 661 transitions. [2019-12-27 20:43:42,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:42,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:43:42,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:43:42,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:42,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:43:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:43:42,079 INFO L87 Difference]: Start difference. First operand 12334 states and 38509 transitions. Second operand 7 states. [2019-12-27 20:43:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:42,538 INFO L93 Difference]: Finished difference Result 37088 states and 113727 transitions. [2019-12-27 20:43:42,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:43:42,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 20:43:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:42,578 INFO L225 Difference]: With dead ends: 37088 [2019-12-27 20:43:42,578 INFO L226 Difference]: Without dead ends: 27206 [2019-12-27 20:43:42,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:43:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27206 states. [2019-12-27 20:43:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27206 to 15725. [2019-12-27 20:43:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15725 states. [2019-12-27 20:43:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15725 states to 15725 states and 49042 transitions. [2019-12-27 20:43:42,931 INFO L78 Accepts]: Start accepts. Automaton has 15725 states and 49042 transitions. Word has length 57 [2019-12-27 20:43:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:42,932 INFO L462 AbstractCegarLoop]: Abstraction has 15725 states and 49042 transitions. [2019-12-27 20:43:42,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:43:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 15725 states and 49042 transitions. [2019-12-27 20:43:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:42,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:42,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:42,950 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1810961603, now seen corresponding path program 3 times [2019-12-27 20:43:42,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:42,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345666186] [2019-12-27 20:43:42,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:43,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345666186] [2019-12-27 20:43:43,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:43,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:43:43,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2051837085] [2019-12-27 20:43:43,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:43,154 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:43,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 365 states and 712 transitions. [2019-12-27 20:43:43,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:43,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 20:43:43,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:43:43,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:43:43,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:43:43,894 INFO L87 Difference]: Start difference. First operand 15725 states and 49042 transitions. Second operand 13 states. [2019-12-27 20:43:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:51,047 INFO L93 Difference]: Finished difference Result 120150 states and 370120 transitions. [2019-12-27 20:43:51,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-27 20:43:51,048 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 20:43:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:51,187 INFO L225 Difference]: With dead ends: 120150 [2019-12-27 20:43:51,188 INFO L226 Difference]: Without dead ends: 89320 [2019-12-27 20:43:51,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1056, Invalid=4200, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 20:43:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89320 states. [2019-12-27 20:43:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89320 to 25541. [2019-12-27 20:43:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25541 states. [2019-12-27 20:43:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25541 states to 25541 states and 80299 transitions. [2019-12-27 20:43:52,127 INFO L78 Accepts]: Start accepts. Automaton has 25541 states and 80299 transitions. Word has length 57 [2019-12-27 20:43:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:52,128 INFO L462 AbstractCegarLoop]: Abstraction has 25541 states and 80299 transitions. [2019-12-27 20:43:52,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:43:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 25541 states and 80299 transitions. [2019-12-27 20:43:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:52,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:52,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:52,159 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:52,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash -906088077, now seen corresponding path program 4 times [2019-12-27 20:43:52,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:52,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609271139] [2019-12-27 20:43:52,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:52,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609271139] [2019-12-27 20:43:52,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:52,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:43:52,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1066726895] [2019-12-27 20:43:52,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:52,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:52,550 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 326 transitions. [2019-12-27 20:43:52,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:52,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:43:52,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:43:52,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:52,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:43:52,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:43:52,731 INFO L87 Difference]: Start difference. First operand 25541 states and 80299 transitions. Second operand 11 states. [2019-12-27 20:43:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:55,096 INFO L93 Difference]: Finished difference Result 94517 states and 287140 transitions. [2019-12-27 20:43:55,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 20:43:55,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-27 20:43:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:55,230 INFO L225 Difference]: With dead ends: 94517 [2019-12-27 20:43:55,230 INFO L226 Difference]: Without dead ends: 86359 [2019-12-27 20:43:55,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 20:43:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86359 states. [2019-12-27 20:43:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86359 to 25591. [2019-12-27 20:43:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25591 states. [2019-12-27 20:43:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25591 states to 25591 states and 80494 transitions. [2019-12-27 20:43:56,416 INFO L78 Accepts]: Start accepts. Automaton has 25591 states and 80494 transitions. Word has length 57 [2019-12-27 20:43:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:56,417 INFO L462 AbstractCegarLoop]: Abstraction has 25591 states and 80494 transitions. [2019-12-27 20:43:56,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:43:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 25591 states and 80494 transitions. [2019-12-27 20:43:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:56,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:56,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] [2019-12-27 20:43:56,445 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1870208530, now seen corresponding path program 1 times [2019-12-27 20:43:56,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:56,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445280868] [2019-12-27 20:43:56,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:56,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445280868] [2019-12-27 20:43:56,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:56,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:43:56,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [517734261] [2019-12-27 20:43:56,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:56,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:56,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 326 transitions. [2019-12-27 20:43:56,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:56,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:43:56,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:43:56,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:56,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:43:56,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:43:56,700 INFO L87 Difference]: Start difference. First operand 25591 states and 80494 transitions. Second operand 3 states. [2019-12-27 20:43:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:56,810 INFO L93 Difference]: Finished difference Result 27177 states and 83159 transitions. [2019-12-27 20:43:56,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:43:56,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 20:43:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:56,847 INFO L225 Difference]: With dead ends: 27177 [2019-12-27 20:43:56,847 INFO L226 Difference]: Without dead ends: 27177 [2019-12-27 20:43:56,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:43:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27177 states. [2019-12-27 20:43:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27177 to 20753. [2019-12-27 20:43:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20753 states. [2019-12-27 20:43:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20753 states to 20753 states and 63893 transitions. [2019-12-27 20:43:57,234 INFO L78 Accepts]: Start accepts. Automaton has 20753 states and 63893 transitions. Word has length 57 [2019-12-27 20:43:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:57,234 INFO L462 AbstractCegarLoop]: Abstraction has 20753 states and 63893 transitions. [2019-12-27 20:43:57,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:43:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20753 states and 63893 transitions. [2019-12-27 20:43:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:57,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:57,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:57,258 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:57,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1888273665, now seen corresponding path program 5 times [2019-12-27 20:43:57,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:57,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885001169] [2019-12-27 20:43:57,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:57,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885001169] [2019-12-27 20:43:57,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:57,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:43:57,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802293971] [2019-12-27 20:43:57,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:57,357 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:57,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 321 states and 609 transitions. [2019-12-27 20:43:57,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:57,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:43:57,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:43:57,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:43:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:43:57,857 INFO L87 Difference]: Start difference. First operand 20753 states and 63893 transitions. Second operand 9 states. [2019-12-27 20:43:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:59,433 INFO L93 Difference]: Finished difference Result 49733 states and 149665 transitions. [2019-12-27 20:43:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:43:59,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 20:43:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:59,494 INFO L225 Difference]: With dead ends: 49733 [2019-12-27 20:43:59,494 INFO L226 Difference]: Without dead ends: 42991 [2019-12-27 20:43:59,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:43:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42991 states. [2019-12-27 20:43:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42991 to 20969. [2019-12-27 20:43:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-27 20:44:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 64530 transitions. [2019-12-27 20:44:00,012 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 64530 transitions. Word has length 57 [2019-12-27 20:44:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:44:00,012 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 64530 transitions. [2019-12-27 20:44:00,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:44:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 64530 transitions. [2019-12-27 20:44:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:44:00,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:44:00,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:44:00,038 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:44:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:44:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash 546690713, now seen corresponding path program 6 times [2019-12-27 20:44:00,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:44:00,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5792774] [2019-12-27 20:44:00,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:44:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:44:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:44:00,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5792774] [2019-12-27 20:44:00,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:44:00,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:44:00,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [159559903] [2019-12-27 20:44:00,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:44:00,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:44:00,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 433 states and 781 transitions. [2019-12-27 20:44:00,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:44:00,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:44:00,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:44:00,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:44:00,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:44:00,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:44:00,707 INFO L87 Difference]: Start difference. First operand 20969 states and 64530 transitions. Second operand 3 states. [2019-12-27 20:44:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:44:00,771 INFO L93 Difference]: Finished difference Result 17480 states and 52726 transitions. [2019-12-27 20:44:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:44:00,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 20:44:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:44:00,795 INFO L225 Difference]: With dead ends: 17480 [2019-12-27 20:44:00,795 INFO L226 Difference]: Without dead ends: 17480 [2019-12-27 20:44:00,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:44:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17480 states. [2019-12-27 20:44:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17480 to 16901. [2019-12-27 20:44:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2019-12-27 20:44:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 50942 transitions. [2019-12-27 20:44:01,080 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 50942 transitions. Word has length 57 [2019-12-27 20:44:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:44:01,080 INFO L462 AbstractCegarLoop]: Abstraction has 16901 states and 50942 transitions. [2019-12-27 20:44:01,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:44:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 50942 transitions. [2019-12-27 20:44:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 20:44:01,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:44:01,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:44:01,101 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:44:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:44:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash -40363112, now seen corresponding path program 1 times [2019-12-27 20:44:01,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:44:01,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481258544] [2019-12-27 20:44:01,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:44:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:44:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:44:01,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481258544] [2019-12-27 20:44:01,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:44:01,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:44:01,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [233943893] [2019-12-27 20:44:01,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:44:01,412 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:44:01,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 348 states and 616 transitions. [2019-12-27 20:44:01,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:44:02,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:44:02,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 20:44:02,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:44:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 20:44:02,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:44:02,188 INFO L87 Difference]: Start difference. First operand 16901 states and 50942 transitions. Second operand 21 states. [2019-12-27 20:44:03,514 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-12-27 20:44:03,953 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-12-27 20:44:04,482 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-27 20:44:04,823 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-12-27 20:44:04,980 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-12-27 20:44:05,117 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-27 20:44:05,689 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-12-27 20:44:06,012 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-27 20:44:06,660 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-12-27 20:44:08,302 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-12-27 20:44:09,221 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-12-27 20:44:09,469 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-12-27 20:44:09,649 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-12-27 20:44:09,822 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-12-27 20:44:10,751 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-12-27 20:44:11,578 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-12-27 20:44:13,096 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-12-27 20:44:13,857 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-27 20:44:14,113 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-12-27 20:44:14,977 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-12-27 20:44:15,418 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-12-27 20:44:16,874 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-12-27 20:44:17,012 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-12-27 20:44:17,361 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-12-27 20:44:18,751 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-12-27 20:44:19,037 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-12-27 20:44:23,850 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-27 20:44:24,249 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-12-27 20:44:24,422 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-27 20:44:27,582 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-27 20:44:27,736 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-12-27 20:44:30,678 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 Received shutdown request... [2019-12-27 20:44:32,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-12-27 20:44:32,203 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 20:44:32,207 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 20:44:32,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:44:32 BasicIcfg [2019-12-27 20:44:32,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:44:32,209 INFO L168 Benchmark]: Toolchain (without parser) took 210555.49 ms. Allocated memory was 143.1 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:44:32,210 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 20:44:32,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.20 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 99.4 MB in the beginning and 153.4 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:44:32,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.39 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:44:32,211 INFO L168 Benchmark]: Boogie Preprocessor took 38.48 ms. Allocated memory is still 200.3 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:44:32,212 INFO L168 Benchmark]: RCFGBuilder took 818.23 ms. Allocated memory is still 200.3 MB. Free memory was 148.5 MB in the beginning and 99.4 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:44:32,212 INFO L168 Benchmark]: TraceAbstraction took 208825.87 ms. Allocated memory was 200.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 98.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 20:44:32,216 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.20 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 99.4 MB in the beginning and 153.4 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.39 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.48 ms. Allocated memory is still 200.3 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.23 ms. Allocated memory is still 200.3 MB. Free memory was 148.5 MB in the beginning and 99.4 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208825.87 ms. Allocated memory was 200.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 98.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7362 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 78681 CheckedPairsTotal, 120 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (16901states) and FLOYD_HOARE automaton (currently 232 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (86539 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (16901states) and FLOYD_HOARE automaton (currently 232 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (86539 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: TIMEOUT, OverallTime: 208.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 68.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4683 SDtfs, 10042 SDslu, 17075 SDs, 0 SdLazy, 19257 SolverSat, 1094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 102 SyntacticMatches, 27 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25971 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241474occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 81.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 339577 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 134661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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