/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/rfi002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:50:46,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:50:46,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:50:46,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:50:46,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:50:46,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:50:46,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:50:46,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:50:46,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:50:46,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:50:46,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:50:46,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:50:46,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:50:46,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:50:46,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:50:46,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:50:46,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:50:46,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:50:46,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:50:46,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:50:46,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:50:46,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:50:46,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:50:46,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:50:46,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:50:46,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:50:46,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:50:46,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:50:46,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:50:46,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:50:46,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:50:46,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:50:46,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:50:46,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:50:46,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:50:46,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:50:46,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:50:46,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:50:46,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:50:46,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:50:46,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:50:46,535 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 21:50:46,552 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:50:46,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:50:46,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:50:46,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:50:46,554 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:50:46,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:50:46,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:50:46,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:50:46,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:50:46,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:50:46,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:50:46,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:50:46,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:50:46,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:50:46,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:50:46,556 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:50:46,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:50:46,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:50:46,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:50:46,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:50:46,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:50:46,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:50:46,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:50:46,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:50:46,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:50:46,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:50:46,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:50:46,558 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:50:46,559 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:50:46,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:50:46,559 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:50:46,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:50:46,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:50:46,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:50:46,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:50:46,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:50:46,874 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:50:46,874 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-27 21:50:46,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5b06a788/5deba092e90b483ebc04d8447ffdbf4d/FLAG689718c13 [2019-12-27 21:50:47,499 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:50:47,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-27 21:50:47,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5b06a788/5deba092e90b483ebc04d8447ffdbf4d/FLAG689718c13 [2019-12-27 21:50:47,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5b06a788/5deba092e90b483ebc04d8447ffdbf4d [2019-12-27 21:50:47,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:50:47,774 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:50:47,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:47,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:50:47,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:50:47,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:47" (1/1) ... [2019-12-27 21:50:47,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:47, skipping insertion in model container [2019-12-27 21:50:47,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:47" (1/1) ... [2019-12-27 21:50:47,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:50:47,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:50:48,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:48,446 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:50:48,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:48,594 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:50:48,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48 WrapperNode [2019-12-27 21:50:48,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:48,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:48,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:50:48,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:50:48,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (1/1) ... [2019-12-27 21:50:48,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (1/1) ... [2019-12-27 21:50:48,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:48,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:50:48,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:50:48,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:50:48,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (1/1) ... [2019-12-27 21:50:48,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (1/1) ... [2019-12-27 21:50:48,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (1/1) ... [2019-12-27 21:50:48,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (1/1) ... [2019-12-27 21:50:48,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (1/1) ... [2019-12-27 21:50:48,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (1/1) ... [2019-12-27 21:50:48,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (1/1) ... [2019-12-27 21:50:48,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:50:48,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:50:48,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:50:48,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:50:48,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (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 21:50:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:50:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:50:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:50:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:50:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:50:48,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:50:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:50:48,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:50:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:50:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:50:48,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:50:48,810 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 21:50:49,956 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:50:49,956 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:50:49,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:49 BoogieIcfgContainer [2019-12-27 21:50:49,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:50:49,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:50:49,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:50:49,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:50:49,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:50:47" (1/3) ... [2019-12-27 21:50:49,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb0ea96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:49, skipping insertion in model container [2019-12-27 21:50:49,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:48" (2/3) ... [2019-12-27 21:50:49,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb0ea96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:49, skipping insertion in model container [2019-12-27 21:50:49,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:49" (3/3) ... [2019-12-27 21:50:49,969 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.opt.i [2019-12-27 21:50:49,980 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:50:49,980 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:50:49,992 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:50:49,993 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:50:50,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,118 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,119 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,128 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:50,148 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:50:50,168 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:50:50,168 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:50:50,169 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:50:50,169 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:50:50,169 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:50:50,169 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:50:50,169 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:50:50,169 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:50:50,189 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 21:50:50,191 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 21:50:50,393 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 21:50:50,393 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:50,446 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 21:50:50,556 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 21:50:50,696 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 21:50:50,696 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:50,720 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 21:50:50,770 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 21:50:50,771 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:50:54,897 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:50:55,002 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:50:55,126 INFO L206 etLargeBlockEncoding]: Checked pairs total: 331194 [2019-12-27 21:50:55,126 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-27 21:50:55,129 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 194 transitions [2019-12-27 21:51:10,944 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120671 states. [2019-12-27 21:51:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 120671 states. [2019-12-27 21:51:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:51:10,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:10,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:51:10,956 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1348557133, now seen corresponding path program 1 times [2019-12-27 21:51:10,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:10,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663058668] [2019-12-27 21:51:10,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:11,232 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 21:51:11,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663058668] [2019-12-27 21:51:11,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:11,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:51:11,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1677716457] [2019-12-27 21:51:11,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:11,240 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:11,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:51:11,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:11,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:51:11,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:51:11,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:11,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:51:11,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:51:11,276 INFO L87 Difference]: Start difference. First operand 120671 states. Second operand 3 states. [2019-12-27 21:51:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:13,004 INFO L93 Difference]: Finished difference Result 120599 states and 454207 transitions. [2019-12-27 21:51:13,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:51:13,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:51:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:13,702 INFO L225 Difference]: With dead ends: 120599 [2019-12-27 21:51:13,702 INFO L226 Difference]: Without dead ends: 118034 [2019-12-27 21:51:13,704 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 21:51:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118034 states. [2019-12-27 21:51:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118034 to 118034. [2019-12-27 21:51:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118034 states. [2019-12-27 21:51:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118034 states to 118034 states and 445141 transitions. [2019-12-27 21:51:26,896 INFO L78 Accepts]: Start accepts. Automaton has 118034 states and 445141 transitions. Word has length 5 [2019-12-27 21:51:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:26,897 INFO L462 AbstractCegarLoop]: Abstraction has 118034 states and 445141 transitions. [2019-12-27 21:51:26,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:51:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 118034 states and 445141 transitions. [2019-12-27 21:51:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:51:26,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:26,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:26,900 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:26,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1001758947, now seen corresponding path program 1 times [2019-12-27 21:51:26,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:26,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592914944] [2019-12-27 21:51:26,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:27,021 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 21:51:27,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592914944] [2019-12-27 21:51:27,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:27,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:51:27,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1334146937] [2019-12-27 21:51:27,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:27,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:27,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:51:27,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:27,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:51:27,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:51:27,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:51:27,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:51:27,088 INFO L87 Difference]: Start difference. First operand 118034 states and 445141 transitions. Second operand 5 states. [2019-12-27 21:51:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:32,988 INFO L93 Difference]: Finished difference Result 156706 states and 575012 transitions. [2019-12-27 21:51:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:51:32,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:51:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:33,663 INFO L225 Difference]: With dead ends: 156706 [2019-12-27 21:51:33,663 INFO L226 Difference]: Without dead ends: 156706 [2019-12-27 21:51:33,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 21:51:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156706 states. [2019-12-27 21:51:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156706 to 156473. [2019-12-27 21:51:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156473 states. [2019-12-27 21:51:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156473 states to 156473 states and 574351 transitions. [2019-12-27 21:51:43,272 INFO L78 Accepts]: Start accepts. Automaton has 156473 states and 574351 transitions. Word has length 11 [2019-12-27 21:51:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:43,272 INFO L462 AbstractCegarLoop]: Abstraction has 156473 states and 574351 transitions. [2019-12-27 21:51:43,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:51:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 156473 states and 574351 transitions. [2019-12-27 21:51:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:51:43,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:43,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:43,276 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1039090903, now seen corresponding path program 1 times [2019-12-27 21:51:43,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:43,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692889606] [2019-12-27 21:51:43,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:43,363 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 21:51:43,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692889606] [2019-12-27 21:51:43,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:43,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:51:43,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [977675119] [2019-12-27 21:51:43,365 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:43,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:43,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:51:43,367 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:43,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:51:43,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:51:43,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:43,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:51:43,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:51:43,368 INFO L87 Difference]: Start difference. First operand 156473 states and 574351 transitions. Second operand 4 states. [2019-12-27 21:51:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:43,458 INFO L93 Difference]: Finished difference Result 12243 states and 33691 transitions. [2019-12-27 21:51:43,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:51:43,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:51:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:43,474 INFO L225 Difference]: With dead ends: 12243 [2019-12-27 21:51:43,474 INFO L226 Difference]: Without dead ends: 8871 [2019-12-27 21:51:43,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:51:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2019-12-27 21:51:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 8863. [2019-12-27 21:51:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8863 states. [2019-12-27 21:51:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8863 states to 8863 states and 22087 transitions. [2019-12-27 21:51:43,667 INFO L78 Accepts]: Start accepts. Automaton has 8863 states and 22087 transitions. Word has length 11 [2019-12-27 21:51:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:43,668 INFO L462 AbstractCegarLoop]: Abstraction has 8863 states and 22087 transitions. [2019-12-27 21:51:43,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:51:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 8863 states and 22087 transitions. [2019-12-27 21:51:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:51:43,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:43,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:43,674 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:43,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:43,676 INFO L82 PathProgramCache]: Analyzing trace with hash -82071627, now seen corresponding path program 1 times [2019-12-27 21:51:43,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:43,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238600030] [2019-12-27 21:51:43,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:43,976 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 21:51:43,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238600030] [2019-12-27 21:51:43,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:43,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:51:43,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084899708] [2019-12-27 21:51:43,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:43,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:43,992 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 21:51:43,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:44,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:51:44,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:51:44,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:44,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:51:44,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:51:44,139 INFO L87 Difference]: Start difference. First operand 8863 states and 22087 transitions. Second operand 11 states. [2019-12-27 21:51:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:46,599 INFO L93 Difference]: Finished difference Result 10373 states and 25522 transitions. [2019-12-27 21:51:46,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:51:46,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 21:51:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:46,615 INFO L225 Difference]: With dead ends: 10373 [2019-12-27 21:51:46,615 INFO L226 Difference]: Without dead ends: 10373 [2019-12-27 21:51:46,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:51:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10373 states. [2019-12-27 21:51:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10373 to 10258. [2019-12-27 21:51:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10258 states. [2019-12-27 21:51:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10258 states to 10258 states and 25292 transitions. [2019-12-27 21:51:46,788 INFO L78 Accepts]: Start accepts. Automaton has 10258 states and 25292 transitions. Word has length 25 [2019-12-27 21:51:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:46,789 INFO L462 AbstractCegarLoop]: Abstraction has 10258 states and 25292 transitions. [2019-12-27 21:51:46,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:51:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 10258 states and 25292 transitions. [2019-12-27 21:51:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 21:51:46,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:46,795 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] [2019-12-27 21:51:46,796 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:46,796 INFO L82 PathProgramCache]: Analyzing trace with hash 648735531, now seen corresponding path program 1 times [2019-12-27 21:51:46,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:46,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987980140] [2019-12-27 21:51:46,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:47,025 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 21:51:47,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987980140] [2019-12-27 21:51:47,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:47,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:51:47,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600915782] [2019-12-27 21:51:47,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:47,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:47,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 170 transitions. [2019-12-27 21:51:47,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:47,218 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:51:47,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:51:47,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:47,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:51:47,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:51:47,219 INFO L87 Difference]: Start difference. First operand 10258 states and 25292 transitions. Second operand 13 states. [2019-12-27 21:51:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:49,924 INFO L93 Difference]: Finished difference Result 11253 states and 27362 transitions. [2019-12-27 21:51:49,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:51:49,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-12-27 21:51:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:49,938 INFO L225 Difference]: With dead ends: 11253 [2019-12-27 21:51:49,938 INFO L226 Difference]: Without dead ends: 11205 [2019-12-27 21:51:49,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:51:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11205 states. [2019-12-27 21:51:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11205 to 10966. [2019-12-27 21:51:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10966 states. [2019-12-27 21:51:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10966 states to 10966 states and 26799 transitions. [2019-12-27 21:51:50,149 INFO L78 Accepts]: Start accepts. Automaton has 10966 states and 26799 transitions. Word has length 38 [2019-12-27 21:51:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:50,149 INFO L462 AbstractCegarLoop]: Abstraction has 10966 states and 26799 transitions. [2019-12-27 21:51:50,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:51:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10966 states and 26799 transitions. [2019-12-27 21:51:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 21:51:50,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:50,171 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] [2019-12-27 21:51:50,171 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:50,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1308054868, now seen corresponding path program 1 times [2019-12-27 21:51:50,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:50,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105478367] [2019-12-27 21:51:50,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:50,479 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 21:51:50,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105478367] [2019-12-27 21:51:50,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:50,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:51:50,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [115692374] [2019-12-27 21:51:50,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:50,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:50,555 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 206 transitions. [2019-12-27 21:51:50,555 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:50,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:51:50,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:51:50,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:50,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:51:50,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:51:50,747 INFO L87 Difference]: Start difference. First operand 10966 states and 26799 transitions. Second operand 14 states. [2019-12-27 21:51:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:55,192 INFO L93 Difference]: Finished difference Result 12991 states and 31377 transitions. [2019-12-27 21:51:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:51:55,192 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-12-27 21:51:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:55,208 INFO L225 Difference]: With dead ends: 12991 [2019-12-27 21:51:55,208 INFO L226 Difference]: Without dead ends: 12991 [2019-12-27 21:51:55,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:51:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12991 states. [2019-12-27 21:51:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12991 to 11783. [2019-12-27 21:51:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11783 states. [2019-12-27 21:51:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 28661 transitions. [2019-12-27 21:51:55,401 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 28661 transitions. Word has length 50 [2019-12-27 21:51:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:55,402 INFO L462 AbstractCegarLoop]: Abstraction has 11783 states and 28661 transitions. [2019-12-27 21:51:55,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:51:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 28661 transitions. [2019-12-27 21:51:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:51:55,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:55,418 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 21:51:55,418 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:55,419 INFO L82 PathProgramCache]: Analyzing trace with hash -597968020, now seen corresponding path program 1 times [2019-12-27 21:51:55,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:55,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880608647] [2019-12-27 21:51:55,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:55,511 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 21:51:55,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880608647] [2019-12-27 21:51:55,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:55,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:51:55,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [350924067] [2019-12-27 21:51:55,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:55,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:55,550 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-27 21:51:55,550 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:55,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:51:55,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:51:55,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:55,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:51:55,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:51:55,552 INFO L87 Difference]: Start difference. First operand 11783 states and 28661 transitions. Second operand 5 states. [2019-12-27 21:51:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:56,504 INFO L93 Difference]: Finished difference Result 13164 states and 31589 transitions. [2019-12-27 21:51:56,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:51:56,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 21:51:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:56,522 INFO L225 Difference]: With dead ends: 13164 [2019-12-27 21:51:56,523 INFO L226 Difference]: Without dead ends: 13164 [2019-12-27 21:51:56,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:51:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-12-27 21:51:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12761. [2019-12-27 21:51:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12761 states. [2019-12-27 21:51:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12761 states to 12761 states and 30780 transitions. [2019-12-27 21:51:56,693 INFO L78 Accepts]: Start accepts. Automaton has 12761 states and 30780 transitions. Word has length 57 [2019-12-27 21:51:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:56,693 INFO L462 AbstractCegarLoop]: Abstraction has 12761 states and 30780 transitions. [2019-12-27 21:51:56,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:51:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 12761 states and 30780 transitions. [2019-12-27 21:51:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:51:56,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:56,708 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 21:51:56,708 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:56,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash 428916562, now seen corresponding path program 1 times [2019-12-27 21:51:56,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:56,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147515785] [2019-12-27 21:51:56,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:56,818 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 21:51:56,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147515785] [2019-12-27 21:51:56,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:56,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:51:56,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803606330] [2019-12-27 21:51:56,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:56,845 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:56,873 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-27 21:51:56,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:56,874 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:51:56,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:51:56,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:56,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:51:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:51:56,875 INFO L87 Difference]: Start difference. First operand 12761 states and 30780 transitions. Second operand 5 states. [2019-12-27 21:51:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:56,945 INFO L93 Difference]: Finished difference Result 5514 states and 12816 transitions. [2019-12-27 21:51:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:51:56,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:51:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:56,954 INFO L225 Difference]: With dead ends: 5514 [2019-12-27 21:51:56,954 INFO L226 Difference]: Without dead ends: 5256 [2019-12-27 21:51:56,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:51:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2019-12-27 21:51:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5103. [2019-12-27 21:51:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-12-27 21:51:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 11978 transitions. [2019-12-27 21:51:57,048 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 11978 transitions. Word has length 58 [2019-12-27 21:51:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:57,049 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 11978 transitions. [2019-12-27 21:51:57,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:51:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 11978 transitions. [2019-12-27 21:51:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 21:51:57,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:57,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:57,060 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1979048117, now seen corresponding path program 1 times [2019-12-27 21:51:57,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:57,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017474539] [2019-12-27 21:51:57,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:57,236 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 21:51:57,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017474539] [2019-12-27 21:51:57,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:57,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:51:57,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58377939] [2019-12-27 21:51:57,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:57,280 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:57,693 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-27 21:51:57,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:57,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:51:57,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:51:57,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:51:57,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:51:57,695 INFO L87 Difference]: Start difference. First operand 5103 states and 11978 transitions. Second operand 3 states. [2019-12-27 21:51:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:57,769 INFO L93 Difference]: Finished difference Result 5103 states and 11932 transitions. [2019-12-27 21:51:57,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:51:57,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 21:51:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:57,774 INFO L225 Difference]: With dead ends: 5103 [2019-12-27 21:51:57,775 INFO L226 Difference]: Without dead ends: 5103 [2019-12-27 21:51:57,775 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 21:51:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5103 states. [2019-12-27 21:51:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5103 to 5091. [2019-12-27 21:51:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5091 states. [2019-12-27 21:51:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 11910 transitions. [2019-12-27 21:51:57,828 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 11910 transitions. Word has length 94 [2019-12-27 21:51:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:57,828 INFO L462 AbstractCegarLoop]: Abstraction has 5091 states and 11910 transitions. [2019-12-27 21:51:57,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:51:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 11910 transitions. [2019-12-27 21:51:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 21:51:57,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:57,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:57,835 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash 827084238, now seen corresponding path program 1 times [2019-12-27 21:51:57,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:57,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932869241] [2019-12-27 21:51:57,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:57,934 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 21:51:57,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932869241] [2019-12-27 21:51:57,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:57,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:51:57,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048676636] [2019-12-27 21:51:57,935 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:58,041 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:58,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 185 transitions. [2019-12-27 21:51:58,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:58,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:51:58,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:51:58,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:58,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:51:58,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:51:58,189 INFO L87 Difference]: Start difference. First operand 5091 states and 11910 transitions. Second operand 6 states. [2019-12-27 21:51:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:58,885 INFO L93 Difference]: Finished difference Result 5322 states and 12370 transitions. [2019-12-27 21:51:58,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:51:58,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 21:51:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:58,893 INFO L225 Difference]: With dead ends: 5322 [2019-12-27 21:51:58,893 INFO L226 Difference]: Without dead ends: 5322 [2019-12-27 21:51:58,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:51:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-12-27 21:51:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5103. [2019-12-27 21:51:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-12-27 21:51:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 11932 transitions. [2019-12-27 21:51:58,947 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 11932 transitions. Word has length 95 [2019-12-27 21:51:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:58,947 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 11932 transitions. [2019-12-27 21:51:58,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:51:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 11932 transitions. [2019-12-27 21:51:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 21:51:58,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:58,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:58,957 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:58,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:58,957 INFO L82 PathProgramCache]: Analyzing trace with hash -93310818, now seen corresponding path program 2 times [2019-12-27 21:51:58,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:58,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681670095] [2019-12-27 21:51:58,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:59,054 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 21:51:59,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681670095] [2019-12-27 21:51:59,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:59,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:51:59,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2087742960] [2019-12-27 21:51:59,055 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:59,090 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:59,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 329 transitions. [2019-12-27 21:51:59,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:59,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:51:59,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:51:59,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:59,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:51:59,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:51:59,799 INFO L87 Difference]: Start difference. First operand 5103 states and 11932 transitions. Second operand 5 states. [2019-12-27 21:52:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:00,274 INFO L93 Difference]: Finished difference Result 5591 states and 12935 transitions. [2019-12-27 21:52:00,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:52:00,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 21:52:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:00,281 INFO L225 Difference]: With dead ends: 5591 [2019-12-27 21:52:00,281 INFO L226 Difference]: Without dead ends: 5591 [2019-12-27 21:52:00,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:52:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-12-27 21:52:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5244. [2019-12-27 21:52:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5244 states. [2019-12-27 21:52:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 12250 transitions. [2019-12-27 21:52:00,342 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 12250 transitions. Word has length 95 [2019-12-27 21:52:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:00,342 INFO L462 AbstractCegarLoop]: Abstraction has 5244 states and 12250 transitions. [2019-12-27 21:52:00,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:52:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 12250 transitions. [2019-12-27 21:52:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 21:52:00,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:00,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:00,349 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:00,350 INFO L82 PathProgramCache]: Analyzing trace with hash 516666554, now seen corresponding path program 3 times [2019-12-27 21:52:00,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:00,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465588118] [2019-12-27 21:52:00,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:00,475 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 21:52:00,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465588118] [2019-12-27 21:52:00,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:00,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:52:00,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114943335] [2019-12-27 21:52:00,476 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:00,512 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:00,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 232 transitions. [2019-12-27 21:52:00,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:00,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:52:00,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:52:00,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:00,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:52:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:52:00,668 INFO L87 Difference]: Start difference. First operand 5244 states and 12250 transitions. Second operand 3 states. [2019-12-27 21:52:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:00,730 INFO L93 Difference]: Finished difference Result 5244 states and 12249 transitions. [2019-12-27 21:52:00,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:52:00,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-27 21:52:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:00,737 INFO L225 Difference]: With dead ends: 5244 [2019-12-27 21:52:00,737 INFO L226 Difference]: Without dead ends: 5244 [2019-12-27 21:52:00,737 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 21:52:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2019-12-27 21:52:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5120. [2019-12-27 21:52:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5120 states. [2019-12-27 21:52:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5120 states to 5120 states and 12020 transitions. [2019-12-27 21:52:00,795 INFO L78 Accepts]: Start accepts. Automaton has 5120 states and 12020 transitions. Word has length 95 [2019-12-27 21:52:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:00,795 INFO L462 AbstractCegarLoop]: Abstraction has 5120 states and 12020 transitions. [2019-12-27 21:52:00,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:52:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5120 states and 12020 transitions. [2019-12-27 21:52:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:52:00,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:00,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:00,802 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1106579360, now seen corresponding path program 1 times [2019-12-27 21:52:00,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:00,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701348592] [2019-12-27 21:52:00,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:00,968 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 21:52:00,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701348592] [2019-12-27 21:52:00,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:00,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:52:00,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963645798] [2019-12-27 21:52:00,969 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:01,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:01,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 330 transitions. [2019-12-27 21:52:01,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:01,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:52:01,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:52:01,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:01,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:52:01,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:52:01,569 INFO L87 Difference]: Start difference. First operand 5120 states and 12020 transitions. Second operand 10 states. [2019-12-27 21:52:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:02,604 INFO L93 Difference]: Finished difference Result 12417 states and 28314 transitions. [2019-12-27 21:52:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:52:02,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 21:52:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:02,619 INFO L225 Difference]: With dead ends: 12417 [2019-12-27 21:52:02,619 INFO L226 Difference]: Without dead ends: 10735 [2019-12-27 21:52:02,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:52:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10735 states. [2019-12-27 21:52:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10735 to 6855. [2019-12-27 21:52:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6855 states. [2019-12-27 21:52:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6855 states to 6855 states and 16442 transitions. [2019-12-27 21:52:02,732 INFO L78 Accepts]: Start accepts. Automaton has 6855 states and 16442 transitions. Word has length 96 [2019-12-27 21:52:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:02,732 INFO L462 AbstractCegarLoop]: Abstraction has 6855 states and 16442 transitions. [2019-12-27 21:52:02,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:52:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6855 states and 16442 transitions. [2019-12-27 21:52:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:52:02,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:02,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:02,741 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:02,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1106149920, now seen corresponding path program 2 times [2019-12-27 21:52:02,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:02,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913740839] [2019-12-27 21:52:02,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:52:02,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913740839] [2019-12-27 21:52:02,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:02,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:52:02,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501283537] [2019-12-27 21:52:02,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:02,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:03,183 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 213 transitions. [2019-12-27 21:52:03,183 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:03,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:52:03,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:52:03,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:52:03,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:52:03,224 INFO L87 Difference]: Start difference. First operand 6855 states and 16442 transitions. Second operand 8 states. [2019-12-27 21:52:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:04,536 INFO L93 Difference]: Finished difference Result 16444 states and 39444 transitions. [2019-12-27 21:52:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:52:04,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-27 21:52:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:04,557 INFO L225 Difference]: With dead ends: 16444 [2019-12-27 21:52:04,558 INFO L226 Difference]: Without dead ends: 16444 [2019-12-27 21:52:04,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:52:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16444 states. [2019-12-27 21:52:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16444 to 6683. [2019-12-27 21:52:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6683 states. [2019-12-27 21:52:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6683 states to 6683 states and 16026 transitions. [2019-12-27 21:52:04,688 INFO L78 Accepts]: Start accepts. Automaton has 6683 states and 16026 transitions. Word has length 96 [2019-12-27 21:52:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:04,688 INFO L462 AbstractCegarLoop]: Abstraction has 6683 states and 16026 transitions. [2019-12-27 21:52:04,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:52:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6683 states and 16026 transitions. [2019-12-27 21:52:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:52:04,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:04,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:04,697 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash 509064979, now seen corresponding path program 1 times [2019-12-27 21:52:04,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:04,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300740965] [2019-12-27 21:52:04,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:52:04,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300740965] [2019-12-27 21:52:04,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:04,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:52:04,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413489874] [2019-12-27 21:52:04,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:04,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:05,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 212 transitions. [2019-12-27 21:52:05,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:05,371 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:52:05,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:52:05,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:05,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:52:05,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:52:05,372 INFO L87 Difference]: Start difference. First operand 6683 states and 16026 transitions. Second operand 11 states. [2019-12-27 21:52:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:08,923 INFO L93 Difference]: Finished difference Result 30660 states and 73918 transitions. [2019-12-27 21:52:08,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 21:52:08,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-27 21:52:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:08,960 INFO L225 Difference]: With dead ends: 30660 [2019-12-27 21:52:08,960 INFO L226 Difference]: Without dead ends: 28249 [2019-12-27 21:52:08,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=1812, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 21:52:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28249 states. [2019-12-27 21:52:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28249 to 12709. [2019-12-27 21:52:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12709 states. [2019-12-27 21:52:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12709 states to 12709 states and 31821 transitions. [2019-12-27 21:52:09,225 INFO L78 Accepts]: Start accepts. Automaton has 12709 states and 31821 transitions. Word has length 97 [2019-12-27 21:52:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:09,225 INFO L462 AbstractCegarLoop]: Abstraction has 12709 states and 31821 transitions. [2019-12-27 21:52:09,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:52:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 12709 states and 31821 transitions. [2019-12-27 21:52:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:52:09,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:09,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:52:09,239 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1775997735, now seen corresponding path program 2 times [2019-12-27 21:52:09,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:09,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289733940] [2019-12-27 21:52:09,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:09,427 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 21:52:09,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289733940] [2019-12-27 21:52:09,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:09,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:52:09,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957448623] [2019-12-27 21:52:09,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:09,466 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:10,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 327 transitions. [2019-12-27 21:52:10,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:10,099 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:52:10,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:52:10,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:10,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:52:10,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:52:10,100 INFO L87 Difference]: Start difference. First operand 12709 states and 31821 transitions. Second operand 12 states. [2019-12-27 21:52:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:15,228 INFO L93 Difference]: Finished difference Result 76879 states and 190316 transitions. [2019-12-27 21:52:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-12-27 21:52:15,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-27 21:52:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:15,316 INFO L225 Difference]: With dead ends: 76879 [2019-12-27 21:52:15,317 INFO L226 Difference]: Without dead ends: 65323 [2019-12-27 21:52:15,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4015 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1518, Invalid=9402, Unknown=0, NotChecked=0, Total=10920 [2019-12-27 21:52:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65323 states. [2019-12-27 21:52:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65323 to 21129. [2019-12-27 21:52:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2019-12-27 21:52:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 54402 transitions. [2019-12-27 21:52:16,298 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 54402 transitions. Word has length 97 [2019-12-27 21:52:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:16,298 INFO L462 AbstractCegarLoop]: Abstraction has 21129 states and 54402 transitions. [2019-12-27 21:52:16,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:52:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 54402 transitions. [2019-12-27 21:52:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:52:16,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:16,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:16,321 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:16,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1774655159, now seen corresponding path program 3 times [2019-12-27 21:52:16,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:16,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036812839] [2019-12-27 21:52:16,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:52:16,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036812839] [2019-12-27 21:52:16,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:16,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:52:16,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1500832329] [2019-12-27 21:52:16,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:16,488 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:16,718 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 192 transitions. [2019-12-27 21:52:16,719 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:16,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:52:16,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:52:16,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:52:16,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:52:16,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:52:16,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:16,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:52:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:52:16,991 INFO L87 Difference]: Start difference. First operand 21129 states and 54402 transitions. Second operand 12 states. [2019-12-27 21:52:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:18,847 INFO L93 Difference]: Finished difference Result 34891 states and 89618 transitions. [2019-12-27 21:52:18,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:52:18,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-27 21:52:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:18,895 INFO L225 Difference]: With dead ends: 34891 [2019-12-27 21:52:18,895 INFO L226 Difference]: Without dead ends: 33925 [2019-12-27 21:52:18,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:52:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33925 states. [2019-12-27 21:52:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33925 to 23297. [2019-12-27 21:52:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23297 states. [2019-12-27 21:52:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23297 states to 23297 states and 60445 transitions. [2019-12-27 21:52:19,287 INFO L78 Accepts]: Start accepts. Automaton has 23297 states and 60445 transitions. Word has length 97 [2019-12-27 21:52:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:19,287 INFO L462 AbstractCegarLoop]: Abstraction has 23297 states and 60445 transitions. [2019-12-27 21:52:19,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:52:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 23297 states and 60445 transitions. [2019-12-27 21:52:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:52:19,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:19,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:19,321 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash -583300383, now seen corresponding path program 4 times [2019-12-27 21:52:19,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:19,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140995155] [2019-12-27 21:52:19,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:19,521 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 21:52:19,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140995155] [2019-12-27 21:52:19,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:19,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:52:19,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1161594559] [2019-12-27 21:52:19,523 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:19,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:20,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 183 transitions. [2019-12-27 21:52:20,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:20,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:52:20,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:52:20,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:52:20,253 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:52:20,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 21:52:20,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:20,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 21:52:20,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:52:20,254 INFO L87 Difference]: Start difference. First operand 23297 states and 60445 transitions. Second operand 17 states. [2019-12-27 21:52:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:26,790 INFO L93 Difference]: Finished difference Result 51860 states and 132829 transitions. [2019-12-27 21:52:26,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 21:52:26,791 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 97 [2019-12-27 21:52:26,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:26,866 INFO L225 Difference]: With dead ends: 51860 [2019-12-27 21:52:26,866 INFO L226 Difference]: Without dead ends: 50701 [2019-12-27 21:52:26,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=624, Invalid=3666, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 21:52:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50701 states. [2019-12-27 21:52:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50701 to 23668. [2019-12-27 21:52:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2019-12-27 21:52:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 61354 transitions. [2019-12-27 21:52:27,763 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 61354 transitions. Word has length 97 [2019-12-27 21:52:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:27,764 INFO L462 AbstractCegarLoop]: Abstraction has 23668 states and 61354 transitions. [2019-12-27 21:52:27,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 21:52:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 61354 transitions. [2019-12-27 21:52:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:52:27,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:27,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:27,792 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:27,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:27,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1818413719, now seen corresponding path program 5 times [2019-12-27 21:52:27,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:27,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222821855] [2019-12-27 21:52:27,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:27,981 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 21:52:27,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222821855] [2019-12-27 21:52:27,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:27,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:52:27,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1707184606] [2019-12-27 21:52:27,982 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:28,006 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:28,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 171 transitions. [2019-12-27 21:52:28,159 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:28,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:52:28,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:52:28,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:28,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:52:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:52:28,178 INFO L87 Difference]: Start difference. First operand 23668 states and 61354 transitions. Second operand 12 states. [2019-12-27 21:52:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:30,412 INFO L93 Difference]: Finished difference Result 42426 states and 108472 transitions. [2019-12-27 21:52:30,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 21:52:30,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-27 21:52:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:30,468 INFO L225 Difference]: With dead ends: 42426 [2019-12-27 21:52:30,469 INFO L226 Difference]: Without dead ends: 42007 [2019-12-27 21:52:30,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=1724, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 21:52:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42007 states. [2019-12-27 21:52:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42007 to 26026. [2019-12-27 21:52:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26026 states. [2019-12-27 21:52:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26026 states to 26026 states and 67851 transitions. [2019-12-27 21:52:30,916 INFO L78 Accepts]: Start accepts. Automaton has 26026 states and 67851 transitions. Word has length 97 [2019-12-27 21:52:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:30,916 INFO L462 AbstractCegarLoop]: Abstraction has 26026 states and 67851 transitions. [2019-12-27 21:52:30,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:52:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26026 states and 67851 transitions. [2019-12-27 21:52:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:52:30,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:30,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:30,942 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:30,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1729235091, now seen corresponding path program 6 times [2019-12-27 21:52:30,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:30,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298771607] [2019-12-27 21:52:30,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:31,084 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 21:52:31,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298771607] [2019-12-27 21:52:31,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:31,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:52:31,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [838463472] [2019-12-27 21:52:31,086 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:31,109 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:31,691 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 223 transitions. [2019-12-27 21:52:31,691 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:31,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:52:31,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:52:31,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:31,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:52:31,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:52:31,750 INFO L87 Difference]: Start difference. First operand 26026 states and 67851 transitions. Second operand 13 states. [2019-12-27 21:52:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:33,494 INFO L93 Difference]: Finished difference Result 81666 states and 214832 transitions. [2019-12-27 21:52:33,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 21:52:33,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-12-27 21:52:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:33,599 INFO L225 Difference]: With dead ends: 81666 [2019-12-27 21:52:33,599 INFO L226 Difference]: Without dead ends: 71025 [2019-12-27 21:52:33,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:52:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71025 states. [2019-12-27 21:52:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71025 to 28443. [2019-12-27 21:52:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28443 states. [2019-12-27 21:52:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28443 states to 28443 states and 73583 transitions. [2019-12-27 21:52:34,241 INFO L78 Accepts]: Start accepts. Automaton has 28443 states and 73583 transitions. Word has length 97 [2019-12-27 21:52:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:34,241 INFO L462 AbstractCegarLoop]: Abstraction has 28443 states and 73583 transitions. [2019-12-27 21:52:34,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:52:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28443 states and 73583 transitions. [2019-12-27 21:52:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:52:34,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:34,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:34,272 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash 386943467, now seen corresponding path program 7 times [2019-12-27 21:52:34,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:34,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415177218] [2019-12-27 21:52:34,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:34,561 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 21:52:34,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415177218] [2019-12-27 21:52:34,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:34,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 21:52:34,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [50273193] [2019-12-27 21:52:34,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:34,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:34,773 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 175 transitions. [2019-12-27 21:52:34,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:34,808 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:52:34,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:52:34,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:34,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:52:34,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:52:34,810 INFO L87 Difference]: Start difference. First operand 28443 states and 73583 transitions. Second operand 15 states. [2019-12-27 21:52:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:38,828 INFO L93 Difference]: Finished difference Result 57436 states and 146735 transitions. [2019-12-27 21:52:38,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 21:52:38,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-12-27 21:52:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:38,902 INFO L225 Difference]: With dead ends: 57436 [2019-12-27 21:52:38,902 INFO L226 Difference]: Without dead ends: 56706 [2019-12-27 21:52:38,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 21:52:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56706 states. [2019-12-27 21:52:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56706 to 41764. [2019-12-27 21:52:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41764 states. [2019-12-27 21:52:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41764 states to 41764 states and 108836 transitions. [2019-12-27 21:52:39,548 INFO L78 Accepts]: Start accepts. Automaton has 41764 states and 108836 transitions. Word has length 97 [2019-12-27 21:52:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:39,548 INFO L462 AbstractCegarLoop]: Abstraction has 41764 states and 108836 transitions. [2019-12-27 21:52:39,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:52:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 41764 states and 108836 transitions. [2019-12-27 21:52:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:52:39,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:39,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:39,588 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash -774626513, now seen corresponding path program 8 times [2019-12-27 21:52:39,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:39,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823407778] [2019-12-27 21:52:39,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:39,673 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 21:52:39,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823407778] [2019-12-27 21:52:39,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:39,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:52:39,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163983490] [2019-12-27 21:52:39,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:39,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:39,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 177 transitions. [2019-12-27 21:52:39,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:39,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:52:39,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:52:39,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:52:39,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:52:39,859 INFO L87 Difference]: Start difference. First operand 41764 states and 108836 transitions. Second operand 4 states. [2019-12-27 21:52:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:40,227 INFO L93 Difference]: Finished difference Result 44810 states and 116914 transitions. [2019-12-27 21:52:40,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:52:40,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-27 21:52:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:40,291 INFO L225 Difference]: With dead ends: 44810 [2019-12-27 21:52:40,291 INFO L226 Difference]: Without dead ends: 44810 [2019-12-27 21:52:40,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:52:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44810 states. [2019-12-27 21:52:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44810 to 40727. [2019-12-27 21:52:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40727 states. [2019-12-27 21:52:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40727 states to 40727 states and 106541 transitions. [2019-12-27 21:52:41,082 INFO L78 Accepts]: Start accepts. Automaton has 40727 states and 106541 transitions. Word has length 97 [2019-12-27 21:52:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:41,082 INFO L462 AbstractCegarLoop]: Abstraction has 40727 states and 106541 transitions. [2019-12-27 21:52:41,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:52:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 40727 states and 106541 transitions. [2019-12-27 21:52:41,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:52:41,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:41,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:52:41,122 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:41,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:41,123 INFO L82 PathProgramCache]: Analyzing trace with hash -166061845, now seen corresponding path program 9 times [2019-12-27 21:52:41,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:41,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237516910] [2019-12-27 21:52:41,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:41,432 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 21:52:41,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237516910] [2019-12-27 21:52:41,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:41,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 21:52:41,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602806942] [2019-12-27 21:52:41,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:41,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:41,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 215 transitions. [2019-12-27 21:52:41,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:41,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 21:52:41,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 21:52:41,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 21:52:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:52:41,769 INFO L87 Difference]: Start difference. First operand 40727 states and 106541 transitions. Second operand 22 states. [2019-12-27 21:52:48,485 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-12-27 21:53:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:09,303 INFO L93 Difference]: Finished difference Result 191162 states and 489257 transitions. [2019-12-27 21:53:09,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2019-12-27 21:53:09,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2019-12-27 21:53:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:09,580 INFO L225 Difference]: With dead ends: 191162 [2019-12-27 21:53:09,580 INFO L226 Difference]: Without dead ends: 186616 [2019-12-27 21:53:09,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24266 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=7867, Invalid=47123, Unknown=0, NotChecked=0, Total=54990 [2019-12-27 21:53:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186616 states. [2019-12-27 21:53:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186616 to 65531. [2019-12-27 21:53:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65531 states. [2019-12-27 21:53:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65531 states to 65531 states and 173629 transitions. [2019-12-27 21:53:12,013 INFO L78 Accepts]: Start accepts. Automaton has 65531 states and 173629 transitions. Word has length 97 [2019-12-27 21:53:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:12,014 INFO L462 AbstractCegarLoop]: Abstraction has 65531 states and 173629 transitions. [2019-12-27 21:53:12,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 21:53:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 65531 states and 173629 transitions. [2019-12-27 21:53:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:53:12,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:12,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:12,086 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1327631825, now seen corresponding path program 10 times [2019-12-27 21:53:12,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:12,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712405070] [2019-12-27 21:53:12,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:12,184 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 21:53:12,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712405070] [2019-12-27 21:53:12,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:12,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:53:12,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263017667] [2019-12-27 21:53:12,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:12,210 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:12,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 233 transitions. [2019-12-27 21:53:12,412 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:12,422 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:53:12,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:53:12,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:12,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:53:12,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:53:12,424 INFO L87 Difference]: Start difference. First operand 65531 states and 173629 transitions. Second operand 6 states. [2019-12-27 21:53:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:13,782 INFO L93 Difference]: Finished difference Result 52259 states and 121643 transitions. [2019-12-27 21:53:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:53:13,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 21:53:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:13,844 INFO L225 Difference]: With dead ends: 52259 [2019-12-27 21:53:13,845 INFO L226 Difference]: Without dead ends: 52172 [2019-12-27 21:53:13,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:53:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52172 states. [2019-12-27 21:53:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52172 to 41701. [2019-12-27 21:53:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41701 states. [2019-12-27 21:53:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41701 states to 41701 states and 98576 transitions. [2019-12-27 21:53:14,460 INFO L78 Accepts]: Start accepts. Automaton has 41701 states and 98576 transitions. Word has length 97 [2019-12-27 21:53:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:14,460 INFO L462 AbstractCegarLoop]: Abstraction has 41701 states and 98576 transitions. [2019-12-27 21:53:14,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:53:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 41701 states and 98576 transitions. [2019-12-27 21:53:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:53:14,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:14,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:14,498 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:14,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash 627268243, now seen corresponding path program 11 times [2019-12-27 21:53:14,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:14,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232000507] [2019-12-27 21:53:14,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:15,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232000507] [2019-12-27 21:53:15,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:15,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-27 21:53:15,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1149610497] [2019-12-27 21:53:15,679 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:15,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:15,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 148 transitions. [2019-12-27 21:53:15,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:15,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:53:15,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 21:53:15,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:15,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 21:53:15,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:53:15,886 INFO L87 Difference]: Start difference. First operand 41701 states and 98576 transitions. Second operand 27 states. [2019-12-27 21:53:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:23,472 INFO L93 Difference]: Finished difference Result 45219 states and 106351 transitions. [2019-12-27 21:53:23,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 21:53:23,472 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 97 [2019-12-27 21:53:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:23,524 INFO L225 Difference]: With dead ends: 45219 [2019-12-27 21:53:23,524 INFO L226 Difference]: Without dead ends: 45219 [2019-12-27 21:53:23,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=266, Invalid=1990, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 21:53:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45219 states. [2019-12-27 21:53:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45219 to 43441. [2019-12-27 21:53:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43441 states. [2019-12-27 21:53:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43441 states to 43441 states and 102475 transitions. [2019-12-27 21:53:24,059 INFO L78 Accepts]: Start accepts. Automaton has 43441 states and 102475 transitions. Word has length 97 [2019-12-27 21:53:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:24,059 INFO L462 AbstractCegarLoop]: Abstraction has 43441 states and 102475 transitions. [2019-12-27 21:53:24,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 21:53:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 43441 states and 102475 transitions. [2019-12-27 21:53:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:53:24,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:24,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:24,100 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:24,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1887530979, now seen corresponding path program 12 times [2019-12-27 21:53:24,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:24,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449399995] [2019-12-27 21:53:24,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:25,024 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 21:53:25,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449399995] [2019-12-27 21:53:25,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:25,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-27 21:53:25,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [642917620] [2019-12-27 21:53:25,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:25,040 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:25,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 235 transitions. [2019-12-27 21:53:25,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:25,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 21:53:25,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 21:53:25,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:25,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 21:53:25,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 21:53:25,677 INFO L87 Difference]: Start difference. First operand 43441 states and 102475 transitions. Second operand 34 states. [2019-12-27 21:53:25,858 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-12-27 21:53:27,053 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-12-27 21:53:28,806 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-12-27 21:53:29,282 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-12-27 21:53:29,570 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-27 21:53:29,736 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-27 21:53:29,915 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-12-27 21:53:30,246 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-12-27 21:53:30,475 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-12-27 21:53:30,789 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-12-27 21:53:30,957 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-12-27 21:53:31,135 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-12-27 21:53:31,611 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-27 21:53:31,922 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-12-27 21:53:32,174 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-12-27 21:53:32,622 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-27 21:53:33,129 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-12-27 21:53:33,317 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-12-27 21:53:33,758 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-27 21:53:34,145 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-12-27 21:53:34,318 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 21:53:34,985 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-27 21:53:35,164 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-12-27 21:53:35,427 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 21:53:35,753 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-27 21:53:36,597 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-12-27 21:53:37,595 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 21:53:38,368 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-27 21:53:38,564 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 21:53:38,945 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-12-27 21:53:39,557 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-12-27 21:53:39,749 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-12-27 21:53:40,571 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 21:53:41,088 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-27 21:53:41,283 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-12-27 21:53:41,864 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-12-27 21:53:42,173 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-12-27 21:53:43,396 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-27 21:53:43,923 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-12-27 21:53:45,190 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-27 21:53:46,573 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-27 21:53:46,957 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-12-27 21:53:47,161 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-27 21:53:47,585 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 21:53:48,227 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-27 21:53:48,462 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-27 21:53:48,706 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-12-27 21:53:49,387 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-27 21:53:50,014 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-27 21:53:50,227 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-12-27 21:53:50,394 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 21:53:50,603 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-12-27 21:53:51,590 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-27 21:53:52,284 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-12-27 21:53:52,495 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-12-27 21:53:52,646 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-27 21:53:52,830 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-12-27 21:53:53,484 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 21:53:53,693 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-12-27 21:53:54,274 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 21:53:56,282 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-27 21:53:56,969 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-12-27 21:53:57,565 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-12-27 21:53:58,080 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-27 21:53:59,546 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-27 21:54:00,742 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-27 21:54:01,463 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-27 21:54:05,606 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-12-27 21:54:06,444 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-12-27 21:54:08,422 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-12-27 21:54:11,153 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-12-27 21:54:11,434 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-12-27 21:54:12,690 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 21:54:13,561 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-27 21:54:13,830 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-27 21:54:15,943 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-27 21:54:19,332 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-27 21:54:20,404 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-12-27 21:54:20,608 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-12-27 21:54:23,854 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-12-27 21:54:24,957 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 21:54:25,701 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-27 21:54:25,838 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 21:54:29,076 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-27 21:54:31,217 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-12-27 21:54:31,622 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 Received shutdown request... [2019-12-27 21:54:38,360 WARN L209 SmtUtils]: Removed 9 from assertion stack [2019-12-27 21:54:38,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 453 states. [2019-12-27 21:54:38,361 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 21:54:38,363 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 21:54:38,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:54:38 BasicIcfg [2019-12-27 21:54:38,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:54:38,368 INFO L168 Benchmark]: Toolchain (without parser) took 230594.91 ms. Allocated memory was 135.8 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 98.1 MB in the beginning and 485.0 MB in the end (delta: -386.9 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:54:38,369 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:54:38,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.06 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 97.7 MB in the beginning and 151.2 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:38,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.17 ms. Allocated memory is still 200.3 MB. Free memory was 151.2 MB in the beginning and 147.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:38,371 INFO L168 Benchmark]: Boogie Preprocessor took 48.29 ms. Allocated memory is still 200.3 MB. Free memory was 147.6 MB in the beginning and 144.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:38,372 INFO L168 Benchmark]: RCFGBuilder took 1232.26 ms. Allocated memory was 200.3 MB in the beginning and 228.1 MB in the end (delta: 27.8 MB). Free memory was 144.1 MB in the beginning and 189.0 MB in the end (delta: -44.9 MB). Peak memory consumption was 70.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:38,373 INFO L168 Benchmark]: TraceAbstraction took 228407.42 ms. Allocated memory was 228.1 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 187.6 MB in the beginning and 485.0 MB in the end (delta: -297.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:54:38,375 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.16 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.06 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 97.7 MB in the beginning and 151.2 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.17 ms. Allocated memory is still 200.3 MB. Free memory was 151.2 MB in the beginning and 147.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.29 ms. Allocated memory is still 200.3 MB. Free memory was 147.6 MB in the beginning and 144.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1232.26 ms. Allocated memory was 200.3 MB in the beginning and 228.1 MB in the end (delta: 27.8 MB). Free memory was 144.1 MB in the beginning and 189.0 MB in the end (delta: -44.9 MB). Peak memory consumption was 70.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228407.42 ms. Allocated memory was 228.1 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 187.6 MB in the beginning and 485.0 MB in the end (delta: -297.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 244 ProgramPointsBefore, 156 ProgramPointsAfterwards, 326 TransitionsBefore, 194 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 47 ChoiceCompositions, 17563 VarBasedMoverChecksPositive, 349 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 331194 CheckedPairsTotal, 139 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (43441states) and FLOYD_HOARE automaton (currently 453 states, 34 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 50 for 63ms.. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (43441states) and FLOYD_HOARE automaton (currently 453 states, 34 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 50 for 63ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 228.1s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 159.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 13073 SDtfs, 33966 SDslu, 79327 SDs, 0 SdLazy, 73598 SolverSat, 3909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 67.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1544 GetRequests, 295 SyntacticMatches, 51 SemanticMatches, 1197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128208 ImplicationChecksByTransitivity, 68.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156473occurred 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: 32.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 325019 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1990 NumberOfCodeBlocks, 1990 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1964 ConstructedInterpolants, 0 QuantifiedInterpolants, 873936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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