/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-SemanticLbe-McrStrategy.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 11:38:20,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 11:38:20,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 11:38:20,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 11:38:20,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 11:38:20,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 11:38:20,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 11:38:20,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 11:38:20,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 11:38:20,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 11:38:20,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 11:38:20,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 11:38:20,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 11:38:20,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 11:38:20,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 11:38:20,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 11:38:20,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 11:38:20,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 11:38:20,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 11:38:20,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 11:38:20,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 11:38:20,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 11:38:20,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 11:38:20,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 11:38:20,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 11:38:20,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 11:38:20,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 11:38:20,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 11:38:20,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 11:38:20,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 11:38:20,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 11:38:20,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 11:38:20,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 11:38:20,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 11:38:20,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 11:38:20,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 11:38:20,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 11:38:20,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 11:38:20,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 11:38:20,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 11:38:20,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 11:38:20,130 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-SemanticLbe-McrStrategy.epf [2020-04-18 11:38:20,159 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 11:38:20,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 11:38:20,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 11:38:20,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 11:38:20,161 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 11:38:20,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 11:38:20,162 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 11:38:20,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 11:38:20,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 11:38:20,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 11:38:20,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 11:38:20,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 11:38:20,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 11:38:20,163 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 11:38:20,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 11:38:20,164 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 11:38:20,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 11:38:20,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 11:38:20,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 11:38:20,164 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 11:38:20,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 11:38:20,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 11:38:20,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 11:38:20,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 11:38:20,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 11:38:20,166 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 11:38:20,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 11:38:20,166 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 11:38:20,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 11:38:20,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 11:38:20,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 11:38:20,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 11:38:20,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 11:38:20,500 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 11:38:20,501 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 11:38:20,502 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-04-18 11:38:20,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3723a246f/eef608c226ef4aa3958edc9918d5d525/FLAG4fa4b6b09 [2020-04-18 11:38:21,165 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 11:38:21,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-04-18 11:38:21,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3723a246f/eef608c226ef4aa3958edc9918d5d525/FLAG4fa4b6b09 [2020-04-18 11:38:21,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3723a246f/eef608c226ef4aa3958edc9918d5d525 [2020-04-18 11:38:21,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 11:38:21,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 11:38:21,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 11:38:21,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 11:38:21,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 11:38:21,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:38:21" (1/1) ... [2020-04-18 11:38:21,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ebd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:21, skipping insertion in model container [2020-04-18 11:38:21,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:38:21" (1/1) ... [2020-04-18 11:38:21,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 11:38:21,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 11:38:21,728 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-18 11:38:22,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:38:22,157 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 11:38:22,171 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-18 11:38:22,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:38:22,401 INFO L208 MainTranslator]: Completed translation [2020-04-18 11:38:22,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22 WrapperNode [2020-04-18 11:38:22,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 11:38:22,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 11:38:22,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 11:38:22,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 11:38:22,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (1/1) ... [2020-04-18 11:38:22,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (1/1) ... [2020-04-18 11:38:22,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 11:38:22,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 11:38:22,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 11:38:22,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 11:38:22,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (1/1) ... [2020-04-18 11:38:22,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (1/1) ... [2020-04-18 11:38:22,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (1/1) ... [2020-04-18 11:38:22,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (1/1) ... [2020-04-18 11:38:22,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (1/1) ... [2020-04-18 11:38:22,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (1/1) ... [2020-04-18 11:38:22,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (1/1) ... [2020-04-18 11:38:22,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 11:38:22,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 11:38:22,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 11:38:22,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 11:38:22,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (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 [2020-04-18 11:38:22,681 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2020-04-18 11:38:22,682 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2020-04-18 11:38:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 11:38:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-04-18 11:38:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 11:38:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-18 11:38:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 11:38:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-04-18 11:38:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-04-18 11:38:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 11:38:22,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 11:38:22,686 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 11:38:23,942 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 11:38:23,943 INFO L295 CfgBuilder]: Removed 40 assume(true) statements. [2020-04-18 11:38:23,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:38:23 BoogieIcfgContainer [2020-04-18 11:38:23,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 11:38:23,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 11:38:23,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 11:38:23,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 11:38:23,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 11:38:21" (1/3) ... [2020-04-18 11:38:23,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aef9979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:38:23, skipping insertion in model container [2020-04-18 11:38:23,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:38:22" (2/3) ... [2020-04-18 11:38:23,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aef9979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:38:23, skipping insertion in model container [2020-04-18 11:38:23,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:38:23" (3/3) ... [2020-04-18 11:38:23,958 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2020-04-18 11:38:23,967 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 11:38:23,968 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 11:38:23,974 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-04-18 11:38:23,976 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 11:38:24,018 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,018 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,018 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,018 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,019 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,019 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,019 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,019 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,020 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,020 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,020 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,020 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,020 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,021 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,021 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,021 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,021 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,021 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,021 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,022 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,022 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,022 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,022 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,022 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,023 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,023 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,023 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,023 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,023 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,023 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,024 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,024 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,024 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,024 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,024 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,024 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,025 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,025 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,025 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,025 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,025 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,026 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,026 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,026 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,026 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,026 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,027 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,027 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,027 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,027 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,027 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,028 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,028 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,028 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,028 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,029 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,029 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,029 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,029 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,029 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,029 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,030 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,030 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,030 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,030 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,030 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,031 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,031 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,031 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,031 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,031 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,032 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,032 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,032 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,032 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,032 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,033 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,033 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,033 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,033 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,033 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,034 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,034 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,034 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,034 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,034 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,035 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,035 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,035 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,035 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,035 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,036 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,036 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,036 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,036 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,036 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,037 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,037 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,037 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,037 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,037 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,037 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,038 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,038 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,038 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,038 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,038 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,039 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,039 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,039 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,039 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,040 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,040 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,040 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,040 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,040 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,040 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,041 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,041 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,041 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,041 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,042 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,042 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,042 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,042 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,042 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,043 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,043 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,043 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,043 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,043 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,044 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,044 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,044 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,044 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,044 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,044 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,045 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,045 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,045 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,045 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,045 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,046 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,046 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,046 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,046 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,046 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,047 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,047 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,047 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,047 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,047 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,047 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,048 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,048 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,048 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,048 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,048 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,048 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,049 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,049 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,049 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,049 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,049 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,050 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,050 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,050 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,050 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,050 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,050 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,051 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,051 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,051 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,051 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,051 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,052 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,052 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,052 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,052 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,052 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,053 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,053 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,053 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,053 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,053 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,054 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,054 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,056 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,056 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,056 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,061 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,062 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,062 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,062 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,062 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,063 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,063 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,063 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,063 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,064 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,065 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,065 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,066 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,066 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,066 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,066 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,066 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,067 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,067 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,067 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,067 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,067 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,067 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,068 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,068 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,068 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,068 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,068 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,069 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,069 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,069 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,069 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,069 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,069 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,070 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,070 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,070 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,070 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,070 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,070 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,075 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,075 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,075 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,076 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:38:24,114 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-04-18 11:38:24,131 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:38:24,132 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:38:24,132 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:38:24,132 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:38:24,132 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:38:24,132 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:38:24,132 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:38:24,132 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:38:24,179 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 443 transitions, 894 flow [2020-04-18 11:38:24,182 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions, 894 flow [2020-04-18 11:38:24,414 INFO L129 PetriNetUnfolder]: 32/442 cut-off events. [2020-04-18 11:38:24,414 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-04-18 11:38:24,427 INFO L80 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2020-04-18 11:38:24,457 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions, 894 flow [2020-04-18 11:38:24,555 INFO L129 PetriNetUnfolder]: 32/442 cut-off events. [2020-04-18 11:38:24,556 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-04-18 11:38:24,561 INFO L80 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2020-04-18 11:38:24,587 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 30326 [2020-04-18 11:38:24,588 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:38:26,065 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:26,079 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:38:26,080 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:26,081 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2020-04-18 11:38:26,495 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:26,514 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:38:26,515 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:26,515 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2020-04-18 11:38:28,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 11:38:28,962 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:28,978 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:38:28,979 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:28,979 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2020-04-18 11:38:29,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 11:38:30,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 11:38:32,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 11:38:33,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 11:38:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 11:38:36,199 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-04-18 11:38:36,499 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-04-18 11:38:36,668 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2020-04-18 11:38:36,892 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-04-18 11:38:38,837 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 153 DAG size of output: 143 [2020-04-18 11:38:38,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 11:38:38,871 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:38,880 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:40,737 WARN L192 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 135 [2020-04-18 11:38:40,741 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:38:40,743 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2020-04-18 11:38:40,743 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:576, output treesize:594 [2020-04-18 11:38:42,656 WARN L192 SmtUtils]: Spent 1.91 s on a formula simplification that was a NOOP. DAG size: 139 [2020-04-18 11:38:43,944 WARN L192 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 141 [2020-04-18 11:38:44,399 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-04-18 11:38:46,634 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 177 DAG size of output: 171 [2020-04-18 11:38:46,651 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:47,743 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 139 [2020-04-18 11:38:47,743 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:38:47,744 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-04-18 11:38:47,745 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2020-04-18 11:38:48,726 WARN L192 SmtUtils]: Spent 980.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-04-18 11:38:49,220 INFO L206 etLargeBlockEncoding]: Checked pairs total: 106197 [2020-04-18 11:38:49,220 INFO L214 etLargeBlockEncoding]: Total number of compositions: 459 [2020-04-18 11:38:49,223 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 121 transitions, 250 flow [2020-04-18 11:38:49,284 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1414 states. [2020-04-18 11:38:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states. [2020-04-18 11:38:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 11:38:49,292 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:38:49,293 INFO L425 BasicCegarLoop]: trace histogram [1] [2020-04-18 11:38:49,295 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:38:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:49,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1582, now seen corresponding path program 1 times [2020-04-18 11:38:49,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:38:49,322 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [526417870] [2020-04-18 11:38:49,337 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:49,343 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 11:38:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states. [2020-04-18 11:38:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 11:38:49,344 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:38:49,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:49,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1582, now seen corresponding path program 2 times [2020-04-18 11:38:49,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:38:49,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832775356] [2020-04-18 11:38:49,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:38:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:38:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:38:49,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832775356] [2020-04-18 11:38:49,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:38:49,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-04-18 11:38:49,469 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:38:49,469 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:49,469 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 11:38:49,470 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:38:49,473 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:38:49,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 11:38:49,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 11:38:49,478 INFO L87 Difference]: Start difference. First operand 2 states. Second operand 2 states. [2020-04-18 11:38:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:49,483 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2020-04-18 11:38:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states and 1 transitions. [2020-04-18 11:38:49,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:38:49,484 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [526417870] [2020-04-18 11:38:49,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:38:49,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [0] total 0 [2020-04-18 11:38:49,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [526417870] [2020-04-18 11:38:49,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-18 11:38:49,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:38:49,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 11:38:49,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 11:38:49,489 INFO L87 Difference]: Start difference. First operand 1414 states. Second operand 2 states. [2020-04-18 11:38:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:49,540 INFO L93 Difference]: Finished difference Result 1413 states and 3158 transitions. [2020-04-18 11:38:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-18 11:38:49,542 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-04-18 11:38:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:38:49,571 INFO L225 Difference]: With dead ends: 1413 [2020-04-18 11:38:49,571 INFO L226 Difference]: Without dead ends: 1412 [2020-04-18 11:38:49,572 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 11:38:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-04-18 11:38:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2020-04-18 11:38:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2020-04-18 11:38:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3157 transitions. [2020-04-18 11:38:49,705 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3157 transitions. Word has length 1 [2020-04-18 11:38:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:38:49,705 INFO L479 AbstractCegarLoop]: Abstraction has 1412 states and 3157 transitions. [2020-04-18 11:38:49,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-18 11:38:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3157 transitions. [2020-04-18 11:38:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-04-18 11:38:49,707 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:38:49,707 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-04-18 11:38:49,707 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:38:49,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash -936407040, now seen corresponding path program 1 times [2020-04-18 11:38:49,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:38:49,708 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1872745263] [2020-04-18 11:38:49,709 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:49,709 INFO L259 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-04-18 11:38:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2020-04-18 11:38:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-04-18 11:38:49,710 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:38:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash -936407040, now seen corresponding path program 2 times [2020-04-18 11:38:49,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:38:49,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893225816] [2020-04-18 11:38:49,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:38:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:38:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:38:49,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893225816] [2020-04-18 11:38:49,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:38:49,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:38:49,826 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:38:49,827 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:49,828 INFO L259 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-04-18 11:38:49,828 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:38:49,837 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:38:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:38:49,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:38:49,838 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2020-04-18 11:38:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:49,855 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2020-04-18 11:38:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2020-04-18 11:38:49,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:38:49,855 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1872745263] [2020-04-18 11:38:49,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:38:49,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:38:49,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1872745263] [2020-04-18 11:38:49,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:38:49,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:38:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:38:49,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:38:49,857 INFO L87 Difference]: Start difference. First operand 1412 states and 3157 transitions. Second operand 3 states. [2020-04-18 11:38:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:49,928 INFO L93 Difference]: Finished difference Result 2647 states and 5928 transitions. [2020-04-18 11:38:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:38:49,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-04-18 11:38:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:38:49,950 INFO L225 Difference]: With dead ends: 2647 [2020-04-18 11:38:49,950 INFO L226 Difference]: Without dead ends: 2647 [2020-04-18 11:38:49,959 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:38:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2020-04-18 11:38:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1431. [2020-04-18 11:38:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2020-04-18 11:38:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3197 transitions. [2020-04-18 11:38:50,018 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3197 transitions. Word has length 6 [2020-04-18 11:38:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:38:50,019 INFO L479 AbstractCegarLoop]: Abstraction has 1431 states and 3197 transitions. [2020-04-18 11:38:50,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:38:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3197 transitions. [2020-04-18 11:38:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 11:38:50,021 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:38:50,022 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:38:50,022 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:38:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1033817622, now seen corresponding path program 1 times [2020-04-18 11:38:50,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:38:50,024 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1008716630] [2020-04-18 11:38:50,025 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:50,025 INFO L259 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-04-18 11:38:50,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2020-04-18 11:38:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 11:38:50,026 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:38:50,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:50,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1033817622, now seen corresponding path program 2 times [2020-04-18 11:38:50,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:38:50,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877233681] [2020-04-18 11:38:50,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:38:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:38:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:38:50,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877233681] [2020-04-18 11:38:50,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:38:50,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:38:50,188 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:38:50,189 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:50,190 INFO L259 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-04-18 11:38:50,190 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:38:50,194 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:38:50,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:38:50,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:38:50,194 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2020-04-18 11:38:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:50,195 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-04-18 11:38:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-04-18 11:38:50,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:38:50,196 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1008716630] [2020-04-18 11:38:50,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:38:50,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:38:50,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1008716630] [2020-04-18 11:38:50,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:38:50,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:38:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:38:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:38:50,198 INFO L87 Difference]: Start difference. First operand 1431 states and 3197 transitions. Second operand 3 states. [2020-04-18 11:38:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:50,218 INFO L93 Difference]: Finished difference Result 1431 states and 3178 transitions. [2020-04-18 11:38:50,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:38:50,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-04-18 11:38:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:38:50,227 INFO L225 Difference]: With dead ends: 1431 [2020-04-18 11:38:50,228 INFO L226 Difference]: Without dead ends: 1431 [2020-04-18 11:38:50,228 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:38:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-04-18 11:38:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2020-04-18 11:38:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2020-04-18 11:38:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3178 transitions. [2020-04-18 11:38:50,267 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3178 transitions. Word has length 7 [2020-04-18 11:38:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:38:50,267 INFO L479 AbstractCegarLoop]: Abstraction has 1431 states and 3178 transitions. [2020-04-18 11:38:50,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:38:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3178 transitions. [2020-04-18 11:38:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 11:38:50,268 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:38:50,268 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:38:50,269 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:38:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1989177922, now seen corresponding path program 1 times [2020-04-18 11:38:50,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:38:50,270 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [455360933] [2020-04-18 11:38:50,270 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:50,270 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 11:38:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 11:38:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 11:38:50,271 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:38:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1989177922, now seen corresponding path program 2 times [2020-04-18 11:38:50,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:38:50,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70064542] [2020-04-18 11:38:50,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:38:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:38:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:38:50,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70064542] [2020-04-18 11:38:50,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:38:50,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:38:50,453 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:38:50,454 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:50,455 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 11:38:50,455 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:38:50,486 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:38:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:38:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:38:50,487 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 6 states. [2020-04-18 11:38:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:50,581 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 11:38:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 11:38:50,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:38:50,582 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [455360933] [2020-04-18 11:38:50,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:38:50,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-04-18 11:38:50,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [455360933] [2020-04-18 11:38:50,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 11:38:50,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:38:50,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:38:50,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:38:50,585 INFO L87 Difference]: Start difference. First operand 1431 states and 3178 transitions. Second operand 6 states. [2020-04-18 11:38:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:51,213 INFO L93 Difference]: Finished difference Result 1817 states and 4039 transitions. [2020-04-18 11:38:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-18 11:38:51,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-04-18 11:38:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:38:51,224 INFO L225 Difference]: With dead ends: 1817 [2020-04-18 11:38:51,225 INFO L226 Difference]: Without dead ends: 1817 [2020-04-18 11:38:51,229 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:38:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2020-04-18 11:38:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1538. [2020-04-18 11:38:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2020-04-18 11:38:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 3423 transitions. [2020-04-18 11:38:51,273 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 3423 transitions. Word has length 8 [2020-04-18 11:38:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:38:51,274 INFO L479 AbstractCegarLoop]: Abstraction has 1538 states and 3423 transitions. [2020-04-18 11:38:51,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 11:38:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 3423 transitions. [2020-04-18 11:38:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:38:51,278 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:38:51,278 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:38:51,278 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:38:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:51,279 INFO L82 PathProgramCache]: Analyzing trace with hash 339945620, now seen corresponding path program 1 times [2020-04-18 11:38:51,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:38:51,279 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1215887327] [2020-04-18 11:38:51,280 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:51,280 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:38:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-04-18 11:38:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:38:51,283 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:38:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:51,284 INFO L82 PathProgramCache]: Analyzing trace with hash 339945620, now seen corresponding path program 2 times [2020-04-18 11:38:51,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:38:51,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551833177] [2020-04-18 11:38:51,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:38:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:38:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:38:51,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551833177] [2020-04-18 11:38:51,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:38:51,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:38:51,336 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:38:51,337 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:51,339 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:38:51,339 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:38:51,343 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:38:51,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:38:51,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:38:51,344 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-04-18 11:38:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:51,361 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2020-04-18 11:38:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2020-04-18 11:38:51,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:38:51,361 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1215887327] [2020-04-18 11:38:51,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:38:51,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 11:38:51,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1215887327] [2020-04-18 11:38:51,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:38:51,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:38:51,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:38:51,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:38:51,363 INFO L87 Difference]: Start difference. First operand 1538 states and 3423 transitions. Second operand 3 states. [2020-04-18 11:38:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:51,432 INFO L93 Difference]: Finished difference Result 2508 states and 5570 transitions. [2020-04-18 11:38:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:38:51,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-04-18 11:38:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:38:51,445 INFO L225 Difference]: With dead ends: 2508 [2020-04-18 11:38:51,446 INFO L226 Difference]: Without dead ends: 2508 [2020-04-18 11:38:51,446 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:38:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2020-04-18 11:38:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1595. [2020-04-18 11:38:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2020-04-18 11:38:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3543 transitions. [2020-04-18 11:38:51,496 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3543 transitions. Word has length 10 [2020-04-18 11:38:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:38:51,496 INFO L479 AbstractCegarLoop]: Abstraction has 1595 states and 3543 transitions. [2020-04-18 11:38:51,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:38:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3543 transitions. [2020-04-18 11:38:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:38:51,498 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:38:51,498 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:38:51,498 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:38:51,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:51,499 INFO L82 PathProgramCache]: Analyzing trace with hash 801389952, now seen corresponding path program 1 times [2020-04-18 11:38:51,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:38:51,499 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1399183122] [2020-04-18 11:38:51,500 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:51,500 INFO L259 McrAutomatonBuilder]: Finished intersection with 51 states and 86 transitions. [2020-04-18 11:38:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-04-18 11:38:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:38:51,501 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:38:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2014315220, now seen corresponding path program 2 times [2020-04-18 11:38:51,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:38:51,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713858031] [2020-04-18 11:38:51,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:38:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:38:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:38:51,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713858031] [2020-04-18 11:38:51,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:38:51,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:38:51,572 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:38:51,575 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:51,581 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 11:38:51,582 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:38:51,606 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:38:51,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:38:51,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:38:51,607 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 6 states. [2020-04-18 11:38:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:51,770 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2020-04-18 11:38:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 87 transitions. [2020-04-18 11:38:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:38:51,771 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:38:51,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash 801389952, now seen corresponding path program 3 times [2020-04-18 11:38:51,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:38:51,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072239356] [2020-04-18 11:38:51,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:38:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:38:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:38:51,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072239356] [2020-04-18 11:38:51,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:38:51,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:38:51,928 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:38:51,930 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:51,937 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2020-04-18 11:38:51,937 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:38:52,132 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 11:38:52,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:38:52,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-04-18 11:38:52,133 INFO L87 Difference]: Start difference. First operand 53 states and 87 transitions. Second operand 12 states. [2020-04-18 11:38:52,995 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2020-04-18 11:38:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:53,282 INFO L93 Difference]: Finished difference Result 60 states and 95 transitions. [2020-04-18 11:38:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 95 transitions. [2020-04-18 11:38:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:38:53,283 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:38:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:38:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1825561204, now seen corresponding path program 4 times [2020-04-18 11:38:53,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:38:53,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822210342] [2020-04-18 11:38:53,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:38:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:38:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:38:53,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822210342] [2020-04-18 11:38:53,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:38:53,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:38:53,419 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:38:53,421 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:38:53,426 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2020-04-18 11:38:53,427 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:38:53,552 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 11:38:53,555 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:38:53,556 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 11:38:53,556 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:18 [2020-04-18 11:38:53,929 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 10 times. [2020-04-18 11:38:53,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:38:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1130, Unknown=0, NotChecked=0, Total=1482 [2020-04-18 11:38:53,930 INFO L87 Difference]: Start difference. First operand 60 states and 95 transitions. Second operand 17 states. [2020-04-18 11:38:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:38:55,159 INFO L93 Difference]: Finished difference Result 60 states and 95 transitions. [2020-04-18 11:38:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 95 transitions. [2020-04-18 11:38:55,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:38:55,161 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1399183122] [2020-04-18 11:38:55,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:38:55,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-04-18 11:38:55,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1399183122] [2020-04-18 11:38:55,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-04-18 11:38:55,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:38:55,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-04-18 11:38:55,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2219, Unknown=0, NotChecked=0, Total=2862 [2020-04-18 11:38:55,163 INFO L87 Difference]: Start difference. First operand 1595 states and 3543 transitions. Second operand 24 states. [2020-04-18 11:39:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:03,985 INFO L93 Difference]: Finished difference Result 2346 states and 5074 transitions. [2020-04-18 11:39:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-04-18 11:39:03,986 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 14 [2020-04-18 11:39:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:39:03,997 INFO L225 Difference]: With dead ends: 2346 [2020-04-18 11:39:03,998 INFO L226 Difference]: Without dead ends: 2346 [2020-04-18 11:39:04,000 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1299, Invalid=4707, Unknown=0, NotChecked=0, Total=6006 [2020-04-18 11:39:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2020-04-18 11:39:04,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 1604. [2020-04-18 11:39:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2020-04-18 11:39:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3563 transitions. [2020-04-18 11:39:04,039 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3563 transitions. Word has length 14 [2020-04-18 11:39:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:39:04,041 INFO L479 AbstractCegarLoop]: Abstraction has 1604 states and 3563 transitions. [2020-04-18 11:39:04,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-04-18 11:39:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3563 transitions. [2020-04-18 11:39:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:39:04,042 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:39:04,042 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:39:04,042 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:39:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1112722442, now seen corresponding path program 1 times [2020-04-18 11:39:04,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:39:04,043 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1501940260] [2020-04-18 11:39:04,043 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:04,044 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:39:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 11:39:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:39:04,044 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:39:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1112722442, now seen corresponding path program 2 times [2020-04-18 11:39:04,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:04,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877384909] [2020-04-18 11:39:04,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:04,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877384909] [2020-04-18 11:39:04,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:04,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:39:04,198 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:04,200 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:04,203 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:39:04,203 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:04,260 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:39:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 11:39:04,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:39:04,261 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 8 states. [2020-04-18 11:39:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:04,536 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-04-18 11:39:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-04-18 11:39:04,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:39:04,537 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1501940260] [2020-04-18 11:39:04,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:39:04,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:39:04,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1501940260] [2020-04-18 11:39:04,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 11:39:04,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:39:04,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 11:39:04,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-04-18 11:39:04,539 INFO L87 Difference]: Start difference. First operand 1604 states and 3563 transitions. Second operand 8 states. [2020-04-18 11:39:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:05,732 INFO L93 Difference]: Finished difference Result 2171 states and 4796 transitions. [2020-04-18 11:39:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-04-18 11:39:05,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-04-18 11:39:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:39:05,745 INFO L225 Difference]: With dead ends: 2171 [2020-04-18 11:39:05,745 INFO L226 Difference]: Without dead ends: 2143 [2020-04-18 11:39:05,746 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-04-18 11:39:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2020-04-18 11:39:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1654. [2020-04-18 11:39:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2020-04-18 11:39:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3678 transitions. [2020-04-18 11:39:05,786 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3678 transitions. Word has length 14 [2020-04-18 11:39:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:39:05,786 INFO L479 AbstractCegarLoop]: Abstraction has 1654 states and 3678 transitions. [2020-04-18 11:39:05,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 11:39:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3678 transitions. [2020-04-18 11:39:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:05,788 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:39:05,788 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:39:05,788 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:39:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 19280512, now seen corresponding path program 1 times [2020-04-18 11:39:05,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:39:05,789 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [183211609] [2020-04-18 11:39:05,789 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:05,790 INFO L259 McrAutomatonBuilder]: Finished intersection with 58 states and 99 transitions. [2020-04-18 11:39:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2020-04-18 11:39:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:05,791 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:39:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1977254080, now seen corresponding path program 2 times [2020-04-18 11:39:05,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:05,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626265800] [2020-04-18 11:39:05,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:05,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626265800] [2020-04-18 11:39:05,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:05,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:39:05,852 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:05,853 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:05,860 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 89 transitions. [2020-04-18 11:39:05,860 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:05,879 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:39:05,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:39:05,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:39:05,880 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 6 states. [2020-04-18 11:39:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:06,049 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2020-04-18 11:39:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2020-04-18 11:39:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:06,050 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:39:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash 19280512, now seen corresponding path program 3 times [2020-04-18 11:39:06,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:06,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820009254] [2020-04-18 11:39:06,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:06,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820009254] [2020-04-18 11:39:06,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:06,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:39:06,201 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:06,203 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:06,209 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 63 transitions. [2020-04-18 11:39:06,209 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:06,369 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:39:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:39:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-04-18 11:39:06,370 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand 9 states. [2020-04-18 11:39:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:06,942 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2020-04-18 11:39:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 102 transitions. [2020-04-18 11:39:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:06,943 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:39:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1220177490, now seen corresponding path program 4 times [2020-04-18 11:39:06,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:06,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357481878] [2020-04-18 11:39:06,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:07,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357481878] [2020-04-18 11:39:07,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:07,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 11:39:07,516 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:07,518 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:07,522 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 51 transitions. [2020-04-18 11:39:07,522 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:08,683 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 11 times. [2020-04-18 11:39:08,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-04-18 11:39:08,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2020-04-18 11:39:08,685 INFO L87 Difference]: Start difference. First operand 63 states and 102 transitions. Second operand 23 states. [2020-04-18 11:39:09,808 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2020-04-18 11:39:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:10,346 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2020-04-18 11:39:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 105 transitions. [2020-04-18 11:39:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:10,346 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:39:10,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash 266967168, now seen corresponding path program 5 times [2020-04-18 11:39:10,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:10,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855267348] [2020-04-18 11:39:10,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:10,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855267348] [2020-04-18 11:39:10,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:10,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 11:39:10,986 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:10,988 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:10,993 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 43 transitions. [2020-04-18 11:39:10,993 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:12,656 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 11 times. [2020-04-18 11:39:12,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-04-18 11:39:12,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=4664, Unknown=0, NotChecked=0, Total=5256 [2020-04-18 11:39:12,659 INFO L87 Difference]: Start difference. First operand 67 states and 105 transitions. Second operand 25 states. [2020-04-18 11:39:14,162 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2020-04-18 11:39:15,049 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2020-04-18 11:39:15,267 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2020-04-18 11:39:15,607 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 52 [2020-04-18 11:39:15,823 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 45 [2020-04-18 11:39:16,104 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 50 [2020-04-18 11:39:16,468 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 59 [2020-04-18 11:39:16,890 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 57 [2020-04-18 11:39:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:17,049 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2020-04-18 11:39:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 105 transitions. [2020-04-18 11:39:17,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:39:17,051 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [183211609] [2020-04-18 11:39:17,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:39:17,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-04-18 11:39:17,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [183211609] [2020-04-18 11:39:17,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2020-04-18 11:39:17,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:39:17,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2020-04-18 11:39:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=7807, Unknown=0, NotChecked=0, Total=8930 [2020-04-18 11:39:17,054 INFO L87 Difference]: Start difference. First operand 1654 states and 3678 transitions. Second operand 55 states. [2020-04-18 11:39:18,515 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2020-04-18 11:39:18,743 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2020-04-18 11:39:19,201 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 60 [2020-04-18 11:39:19,792 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2020-04-18 11:39:20,148 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 53 [2020-04-18 11:39:20,358 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 46 [2020-04-18 11:39:20,883 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 61 [2020-04-18 11:39:21,172 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 56 [2020-04-18 11:39:21,448 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 53 [2020-04-18 11:39:22,356 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 63 [2020-04-18 11:39:23,053 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 52 [2020-04-18 11:39:23,266 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2020-04-18 11:39:23,945 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 55 [2020-04-18 11:39:25,052 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 57 [2020-04-18 11:39:25,312 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 50 [2020-04-18 11:39:26,120 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 57 [2020-04-18 11:39:26,489 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 60 [2020-04-18 11:39:26,794 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 53 [2020-04-18 11:39:27,568 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 60 [2020-04-18 11:39:32,731 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2020-04-18 11:39:34,253 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-04-18 11:39:34,493 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2020-04-18 11:39:34,661 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2020-04-18 11:39:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:35,132 INFO L93 Difference]: Finished difference Result 2559 states and 5578 transitions. [2020-04-18 11:39:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2020-04-18 11:39:35,132 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 15 [2020-04-18 11:39:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:39:35,144 INFO L225 Difference]: With dead ends: 2559 [2020-04-18 11:39:35,144 INFO L226 Difference]: Without dead ends: 2559 [2020-04-18 11:39:35,148 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5400 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=3087, Invalid=15819, Unknown=0, NotChecked=0, Total=18906 [2020-04-18 11:39:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2020-04-18 11:39:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 1641. [2020-04-18 11:39:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2020-04-18 11:39:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 3633 transitions. [2020-04-18 11:39:35,188 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 3633 transitions. Word has length 15 [2020-04-18 11:39:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:39:35,188 INFO L479 AbstractCegarLoop]: Abstraction has 1641 states and 3633 transitions. [2020-04-18 11:39:35,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 55 states. [2020-04-18 11:39:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 3633 transitions. [2020-04-18 11:39:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:35,189 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:39:35,190 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:39:35,190 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:39:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1964238774, now seen corresponding path program 1 times [2020-04-18 11:39:35,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:39:35,191 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1702598558] [2020-04-18 11:39:35,191 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:35,192 INFO L259 McrAutomatonBuilder]: Finished intersection with 58 states and 99 transitions. [2020-04-18 11:39:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2020-04-18 11:39:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:35,193 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:39:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1980738688, now seen corresponding path program 2 times [2020-04-18 11:39:35,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:35,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237572301] [2020-04-18 11:39:35,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:35,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237572301] [2020-04-18 11:39:35,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:35,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:39:35,249 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:35,250 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:35,256 INFO L259 McrAutomatonBuilder]: Finished intersection with 48 states and 79 transitions. [2020-04-18 11:39:35,256 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:35,275 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:39:35,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:39:35,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:39:35,276 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 6 states. [2020-04-18 11:39:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:35,442 INFO L93 Difference]: Finished difference Result 62 states and 103 transitions. [2020-04-18 11:39:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 103 transitions. [2020-04-18 11:39:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:35,443 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:39:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash -926714196, now seen corresponding path program 3 times [2020-04-18 11:39:35,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:35,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019072103] [2020-04-18 11:39:35,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:35,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019072103] [2020-04-18 11:39:35,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:35,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:39:35,534 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:35,536 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:35,542 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 57 transitions. [2020-04-18 11:39:35,542 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:35,751 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 11:39:35,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:39:35,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-04-18 11:39:35,752 INFO L87 Difference]: Start difference. First operand 62 states and 103 transitions. Second operand 12 states. [2020-04-18 11:39:36,693 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2020-04-18 11:39:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:37,027 INFO L93 Difference]: Finished difference Result 71 states and 117 transitions. [2020-04-18 11:39:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 117 transitions. [2020-04-18 11:39:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:37,027 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:39:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:37,028 INFO L82 PathProgramCache]: Analyzing trace with hash -926978496, now seen corresponding path program 4 times [2020-04-18 11:39:37,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:37,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820132678] [2020-04-18 11:39:37,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:37,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820132678] [2020-04-18 11:39:37,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:37,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:39:37,137 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:37,139 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:37,144 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 55 transitions. [2020-04-18 11:39:37,144 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:37,171 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 11:39:37,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:39:37,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2020-04-18 11:39:37,172 INFO L87 Difference]: Start difference. First operand 71 states and 117 transitions. Second operand 13 states. [2020-04-18 11:39:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:37,930 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2020-04-18 11:39:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 121 transitions. [2020-04-18 11:39:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:37,930 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:39:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash -757821408, now seen corresponding path program 5 times [2020-04-18 11:39:37,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:37,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040734162] [2020-04-18 11:39:37,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:38,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040734162] [2020-04-18 11:39:38,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:38,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:39:38,066 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:38,069 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:38,073 INFO L259 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2020-04-18 11:39:38,073 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:38,216 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 11:39:38,218 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:39:38,218 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 11:39:38,218 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:18 [2020-04-18 11:39:38,476 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 10 times. [2020-04-18 11:39:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:39:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 11:39:38,477 INFO L87 Difference]: Start difference. First operand 76 states and 121 transitions. Second operand 17 states. [2020-04-18 11:39:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:39,979 INFO L93 Difference]: Finished difference Result 78 states and 122 transitions. [2020-04-18 11:39:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2020-04-18 11:39:39,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 11:39:39,982 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:39:39,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:39,982 INFO L82 PathProgramCache]: Analyzing trace with hash -758085708, now seen corresponding path program 6 times [2020-04-18 11:39:39,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:39,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224242208] [2020-04-18 11:39:39,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:40,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224242208] [2020-04-18 11:39:40,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:40,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 11:39:40,149 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:40,151 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:40,155 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 39 transitions. [2020-04-18 11:39:40,156 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:40,304 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 11:39:40,318 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 11:39:40,325 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 11:39:40,325 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-04-18 11:39:40,326 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:23 [2020-04-18 11:39:40,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 11:39:40,829 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 10 times. [2020-04-18 11:39:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 11:39:40,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=3463, Unknown=0, NotChecked=0, Total=4290 [2020-04-18 11:39:40,832 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand 19 states. [2020-04-18 11:39:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:42,947 INFO L93 Difference]: Finished difference Result 92 states and 142 transitions. [2020-04-18 11:39:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions. [2020-04-18 11:39:42,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:39:42,948 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1702598558] [2020-04-18 11:39:42,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:39:42,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-04-18 11:39:42,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1702598558] [2020-04-18 11:39:42,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-04-18 11:39:42,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:39:42,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-04-18 11:39:42,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1264, Invalid=4898, Unknown=0, NotChecked=0, Total=6162 [2020-04-18 11:39:42,952 INFO L87 Difference]: Start difference. First operand 1641 states and 3633 transitions. Second operand 33 states. [2020-04-18 11:39:43,396 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-04-18 11:39:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:54,741 INFO L93 Difference]: Finished difference Result 2499 states and 5380 transitions. [2020-04-18 11:39:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-04-18 11:39:54,741 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 15 [2020-04-18 11:39:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:39:54,753 INFO L225 Difference]: With dead ends: 2499 [2020-04-18 11:39:54,754 INFO L226 Difference]: Without dead ends: 2499 [2020-04-18 11:39:54,757 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3457 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2329, Invalid=8801, Unknown=0, NotChecked=0, Total=11130 [2020-04-18 11:39:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2020-04-18 11:39:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 1668. [2020-04-18 11:39:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-04-18 11:39:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 3693 transitions. [2020-04-18 11:39:54,793 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 3693 transitions. Word has length 15 [2020-04-18 11:39:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:39:54,794 INFO L479 AbstractCegarLoop]: Abstraction has 1668 states and 3693 transitions. [2020-04-18 11:39:54,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-04-18 11:39:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 3693 transitions. [2020-04-18 11:39:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:39:54,795 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:39:54,795 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:39:54,795 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:39:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash 56364802, now seen corresponding path program 1 times [2020-04-18 11:39:54,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:39:54,796 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1848282917] [2020-04-18 11:39:54,797 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:54,797 INFO L259 McrAutomatonBuilder]: Finished intersection with 72 states and 125 transitions. [2020-04-18 11:39:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2020-04-18 11:39:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:39:54,798 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:39:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1765660528, now seen corresponding path program 2 times [2020-04-18 11:39:54,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:54,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140973559] [2020-04-18 11:39:54,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:54,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140973559] [2020-04-18 11:39:54,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:54,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:39:54,859 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:54,862 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:54,873 INFO L259 McrAutomatonBuilder]: Finished intersection with 57 states and 95 transitions. [2020-04-18 11:39:54,873 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:54,896 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:39:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:39:54,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:39:54,897 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 6 states. [2020-04-18 11:39:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:55,079 INFO L93 Difference]: Finished difference Result 78 states and 132 transitions. [2020-04-18 11:39:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 132 transitions. [2020-04-18 11:39:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:39:55,080 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:39:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1348737328, now seen corresponding path program 3 times [2020-04-18 11:39:55,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:55,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745907320] [2020-04-18 11:39:55,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:55,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745907320] [2020-04-18 11:39:55,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:55,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:39:55,247 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:55,250 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:55,258 INFO L259 McrAutomatonBuilder]: Finished intersection with 45 states and 71 transitions. [2020-04-18 11:39:55,259 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:55,455 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:39:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:39:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-04-18 11:39:55,456 INFO L87 Difference]: Start difference. First operand 78 states and 132 transitions. Second operand 9 states. [2020-04-18 11:39:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:39:56,038 INFO L93 Difference]: Finished difference Result 87 states and 144 transitions. [2020-04-18 11:39:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 144 transitions. [2020-04-18 11:39:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:39:56,039 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:39:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:39:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 64530562, now seen corresponding path program 4 times [2020-04-18 11:39:56,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:39:56,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616829717] [2020-04-18 11:39:56,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:39:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:39:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:39:56,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616829717] [2020-04-18 11:39:56,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:39:56,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 11:39:56,401 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:39:56,403 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:39:56,409 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 61 transitions. [2020-04-18 11:39:56,409 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:39:57,399 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 14 times. [2020-04-18 11:39:57,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-04-18 11:39:57,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2020-04-18 11:39:57,401 INFO L87 Difference]: Start difference. First operand 87 states and 144 transitions. Second operand 28 states. [2020-04-18 11:40:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:40:01,373 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2020-04-18 11:40:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 164 transitions. [2020-04-18 11:40:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:40:01,374 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:40:01,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:40:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash 56364802, now seen corresponding path program 5 times [2020-04-18 11:40:01,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:40:01,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964037180] [2020-04-18 11:40:01,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:40:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:40:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:40:01,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964037180] [2020-04-18 11:40:01,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:40:01,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 11:40:01,935 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:40:01,936 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:40:01,942 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 55 transitions. [2020-04-18 11:40:01,942 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:40:04,905 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 15 times. [2020-04-18 11:40:04,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-04-18 11:40:04,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=7678, Unknown=0, NotChecked=0, Total=8372 [2020-04-18 11:40:04,906 INFO L87 Difference]: Start difference. First operand 101 states and 164 transitions. Second operand 31 states. [2020-04-18 11:40:06,823 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-04-18 11:40:07,488 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2020-04-18 11:40:07,924 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 55 [2020-04-18 11:40:08,201 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 57 [2020-04-18 11:40:08,632 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 67 [2020-04-18 11:40:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:40:09,578 INFO L93 Difference]: Finished difference Result 118 states and 184 transitions. [2020-04-18 11:40:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2020-04-18 11:40:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:40:09,578 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:40:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:40:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash -361093598, now seen corresponding path program 6 times [2020-04-18 11:40:09,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:40:09,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784939434] [2020-04-18 11:40:09,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:40:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:40:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:40:10,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784939434] [2020-04-18 11:40:10,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:40:10,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 11:40:10,229 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:40:10,231 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:40:10,236 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions. [2020-04-18 11:40:10,237 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:40:11,471 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 14 times. [2020-04-18 11:40:11,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-04-18 11:40:11,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=11729, Unknown=0, NotChecked=0, Total=12882 [2020-04-18 11:40:11,473 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 29 states. [2020-04-18 11:40:13,148 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 57 [2020-04-18 11:40:13,574 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 67 [2020-04-18 11:40:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:40:14,527 INFO L93 Difference]: Finished difference Result 118 states and 184 transitions. [2020-04-18 11:40:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2020-04-18 11:40:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:40:14,528 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:40:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:40:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1150720592, now seen corresponding path program 7 times [2020-04-18 11:40:14,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:40:14,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715158387] [2020-04-18 11:40:14,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:40:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:40:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:40:14,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715158387] [2020-04-18 11:40:14,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:40:14,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 11:40:14,895 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:40:14,897 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:40:14,903 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions. [2020-04-18 11:40:14,903 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:40:18,163 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 15 times. [2020-04-18 11:40:18,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-04-18 11:40:18,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1517, Invalid=18505, Unknown=0, NotChecked=0, Total=20022 [2020-04-18 11:40:18,166 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 30 states. [2020-04-18 11:40:19,753 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 51 [2020-04-18 11:40:21,002 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2020-04-18 11:40:21,277 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 55 [2020-04-18 11:40:21,688 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2020-04-18 11:40:22,155 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 54 [2020-04-18 11:40:22,534 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 58 [2020-04-18 11:40:23,019 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 55 [2020-04-18 11:40:23,428 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 57 [2020-04-18 11:40:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:40:23,879 INFO L93 Difference]: Finished difference Result 143 states and 224 transitions. [2020-04-18 11:40:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 224 transitions. [2020-04-18 11:40:23,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:40:23,881 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1848282917] [2020-04-18 11:40:23,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:40:23,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-04-18 11:40:23,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1848282917] [2020-04-18 11:40:23,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2020-04-18 11:40:23,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:40:23,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2020-04-18 11:40:23,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2224, Invalid=24508, Unknown=0, NotChecked=0, Total=26732 [2020-04-18 11:40:23,883 INFO L87 Difference]: Start difference. First operand 1668 states and 3693 transitions. Second operand 92 states. [2020-04-18 11:40:24,794 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2020-04-18 11:40:25,207 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 42 [2020-04-18 11:40:25,502 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2020-04-18 11:40:25,871 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 52 [2020-04-18 11:40:26,195 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 56 [2020-04-18 11:40:26,857 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 66 [2020-04-18 11:40:27,160 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2020-04-18 11:40:27,774 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2020-04-18 11:40:28,341 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 61 [2020-04-18 11:40:28,611 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 50 [2020-04-18 11:40:29,485 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 72 [2020-04-18 11:40:29,907 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 60 [2020-04-18 11:40:30,260 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 56 [2020-04-18 11:40:30,975 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 44 [2020-04-18 11:40:31,588 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 66 [2020-04-18 11:40:32,654 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 56 [2020-04-18 11:40:32,977 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 47 [2020-04-18 11:40:33,341 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2020-04-18 11:40:34,250 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 59 [2020-04-18 11:40:35,894 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 61 [2020-04-18 11:40:36,245 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 52 [2020-04-18 11:40:37,555 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 56 [2020-04-18 11:40:38,027 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 64 [2020-04-18 11:40:38,451 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 53 [2020-04-18 11:40:39,835 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 59 [2020-04-18 11:40:40,571 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-04-18 11:40:40,863 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2020-04-18 11:40:42,298 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2020-04-18 11:40:42,853 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 62 [2020-04-18 11:40:43,707 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 74 [2020-04-18 11:40:45,297 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2020-04-18 11:40:47,128 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 47 [2020-04-18 11:40:48,419 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 64 [2020-04-18 11:40:48,653 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 50 [2020-04-18 11:40:49,906 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 67 [2020-04-18 11:40:54,675 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2020-04-18 11:40:55,704 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-04-18 11:40:57,238 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-04-18 11:40:58,836 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2020-04-18 11:40:59,297 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2020-04-18 11:40:59,481 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-04-18 11:40:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:40:59,879 INFO L93 Difference]: Finished difference Result 4023 states and 8859 transitions. [2020-04-18 11:40:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2020-04-18 11:40:59,880 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 17 [2020-04-18 11:40:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:40:59,892 INFO L225 Difference]: With dead ends: 4023 [2020-04-18 11:40:59,892 INFO L226 Difference]: Without dead ends: 4023 [2020-04-18 11:40:59,895 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18569 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=5652, Invalid=48404, Unknown=0, NotChecked=0, Total=54056 [2020-04-18 11:40:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4023 states. [2020-04-18 11:40:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4023 to 1910. [2020-04-18 11:40:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2020-04-18 11:40:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 4281 transitions. [2020-04-18 11:40:59,941 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 4281 transitions. Word has length 17 [2020-04-18 11:40:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:40:59,941 INFO L479 AbstractCegarLoop]: Abstraction has 1910 states and 4281 transitions. [2020-04-18 11:40:59,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 92 states. [2020-04-18 11:40:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 4281 transitions. [2020-04-18 11:40:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:40:59,942 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:40:59,942 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:40:59,943 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:40:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:40:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1970855712, now seen corresponding path program 1 times [2020-04-18 11:40:59,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:40:59,943 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1614228097] [2020-04-18 11:40:59,944 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:40:59,945 INFO L259 McrAutomatonBuilder]: Finished intersection with 79 states and 138 transitions. [2020-04-18 11:40:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-04-18 11:40:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:40:59,946 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:40:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:40:59,946 INFO L82 PathProgramCache]: Analyzing trace with hash -368126334, now seen corresponding path program 2 times [2020-04-18 11:40:59,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:40:59,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75813785] [2020-04-18 11:40:59,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:40:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:40:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:40:59,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75813785] [2020-04-18 11:40:59,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:40:59,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:40:59,998 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:00,000 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:00,011 INFO L259 McrAutomatonBuilder]: Finished intersection with 54 states and 88 transitions. [2020-04-18 11:41:00,011 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:00,032 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:41:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:41:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:41:00,034 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 6 states. [2020-04-18 11:41:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:00,222 INFO L93 Difference]: Finished difference Result 89 states and 151 transitions. [2020-04-18 11:41:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 151 transitions. [2020-04-18 11:41:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:00,223 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:41:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:00,223 INFO L82 PathProgramCache]: Analyzing trace with hash 308464854, now seen corresponding path program 3 times [2020-04-18 11:41:00,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:00,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100697946] [2020-04-18 11:41:00,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:00,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100697946] [2020-04-18 11:41:00,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:00,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:41:00,318 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:00,320 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:00,329 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 66 transitions. [2020-04-18 11:41:00,330 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:00,499 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 11:41:00,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:41:00,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-04-18 11:41:00,500 INFO L87 Difference]: Start difference. First operand 89 states and 151 transitions. Second operand 12 states. [2020-04-18 11:41:01,308 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2020-04-18 11:41:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:01,711 INFO L93 Difference]: Finished difference Result 104 states and 174 transitions. [2020-04-18 11:41:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 174 transitions. [2020-04-18 11:41:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:01,712 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:41:01,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:01,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1024638146, now seen corresponding path program 4 times [2020-04-18 11:41:01,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:01,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129705402] [2020-04-18 11:41:01,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:01,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129705402] [2020-04-18 11:41:01,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:01,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 11:41:01,813 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:01,816 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:01,822 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 64 transitions. [2020-04-18 11:41:01,822 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:01,847 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 11:41:01,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:41:01,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2020-04-18 11:41:01,847 INFO L87 Difference]: Start difference. First operand 104 states and 174 transitions. Second operand 13 states. [2020-04-18 11:41:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:02,776 INFO L93 Difference]: Finished difference Result 115 states and 190 transitions. [2020-04-18 11:41:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 190 transitions. [2020-04-18 11:41:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:02,777 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:41:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash 990215126, now seen corresponding path program 5 times [2020-04-18 11:41:02,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:02,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030229116] [2020-04-18 11:41:02,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:02,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030229116] [2020-04-18 11:41:02,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:02,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:41:02,901 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:02,904 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:02,913 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 64 transitions. [2020-04-18 11:41:02,914 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:02,999 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 11:41:02,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 11:41:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 11:41:03,000 INFO L87 Difference]: Start difference. First operand 115 states and 190 transitions. Second operand 14 states. [2020-04-18 11:41:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:04,100 INFO L93 Difference]: Finished difference Result 127 states and 209 transitions. [2020-04-18 11:41:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 209 transitions. [2020-04-18 11:41:04,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:04,101 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:41:04,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:04,101 INFO L82 PathProgramCache]: Analyzing trace with hash 991319126, now seen corresponding path program 6 times [2020-04-18 11:41:04,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:04,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084939940] [2020-04-18 11:41:04,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:04,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084939940] [2020-04-18 11:41:04,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:04,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:41:04,246 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:04,249 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:04,255 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-04-18 11:41:04,256 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:04,613 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:41:04,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:41:04,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1639, Unknown=0, NotChecked=0, Total=1980 [2020-04-18 11:41:04,614 INFO L87 Difference]: Start difference. First operand 127 states and 209 transitions. Second operand 9 states. [2020-04-18 11:41:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:05,385 INFO L93 Difference]: Finished difference Result 158 states and 249 transitions. [2020-04-18 11:41:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 249 transitions. [2020-04-18 11:41:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:05,387 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:41:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1970855712, now seen corresponding path program 7 times [2020-04-18 11:41:05,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:05,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599577434] [2020-04-18 11:41:05,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:05,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599577434] [2020-04-18 11:41:05,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:05,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:41:05,637 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:05,642 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:05,653 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 11:41:05,653 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:06,163 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 11:41:06,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:41:06,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=2881, Unknown=0, NotChecked=0, Total=3306 [2020-04-18 11:41:06,164 INFO L87 Difference]: Start difference. First operand 158 states and 249 transitions. Second operand 10 states. [2020-04-18 11:41:06,778 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-04-18 11:41:07,036 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-04-18 11:41:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:07,424 INFO L93 Difference]: Finished difference Result 197 states and 309 transitions. [2020-04-18 11:41:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 309 transitions. [2020-04-18 11:41:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:07,425 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 11:41:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1742355660, now seen corresponding path program 8 times [2020-04-18 11:41:07,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:07,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741496712] [2020-04-18 11:41:07,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:07,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741496712] [2020-04-18 11:41:07,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:07,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:41:07,678 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:07,681 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:07,689 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 11:41:07,689 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:08,267 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 11:41:08,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 11:41:08,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=4832, Unknown=0, NotChecked=0, Total=5402 [2020-04-18 11:41:08,268 INFO L87 Difference]: Start difference. First operand 197 states and 309 transitions. Second operand 15 states. [2020-04-18 11:41:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:10,431 INFO L93 Difference]: Finished difference Result 244 states and 378 transitions. [2020-04-18 11:41:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 378 transitions. [2020-04-18 11:41:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:10,433 INFO L105 Mcr]: ---- MCR iteration 7 ---- [2020-04-18 11:41:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:10,433 INFO L82 PathProgramCache]: Analyzing trace with hash -670765052, now seen corresponding path program 9 times [2020-04-18 11:41:10,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:10,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027479514] [2020-04-18 11:41:10,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:10,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027479514] [2020-04-18 11:41:10,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:10,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:41:10,690 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:10,692 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:10,697 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 42 transitions. [2020-04-18 11:41:10,697 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:11,807 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 9 times. [2020-04-18 11:41:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 11:41:11,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=9427, Unknown=0, NotChecked=0, Total=10506 [2020-04-18 11:41:11,809 INFO L87 Difference]: Start difference. First operand 244 states and 378 transitions. Second operand 19 states. [2020-04-18 11:41:13,391 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2020-04-18 11:41:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:13,758 INFO L93 Difference]: Finished difference Result 257 states and 388 transitions. [2020-04-18 11:41:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2020-04-18 11:41:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:13,759 INFO L105 Mcr]: ---- MCR iteration 8 ---- [2020-04-18 11:41:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:13,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1574032500, now seen corresponding path program 10 times [2020-04-18 11:41:13,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:13,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100122458] [2020-04-18 11:41:13,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:14,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100122458] [2020-04-18 11:41:14,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:14,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 11:41:14,095 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:14,098 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:14,104 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 42 transitions. [2020-04-18 11:41:14,105 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:15,347 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 9 times. [2020-04-18 11:41:15,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-04-18 11:41:15,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1382, Invalid=14118, Unknown=0, NotChecked=0, Total=15500 [2020-04-18 11:41:15,348 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 24 states. [2020-04-18 11:41:18,441 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-04-18 11:41:19,047 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2020-04-18 11:41:19,425 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2020-04-18 11:41:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:19,576 INFO L93 Difference]: Finished difference Result 278 states and 419 transitions. [2020-04-18 11:41:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 419 transitions. [2020-04-18 11:41:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:19,577 INFO L105 Mcr]: ---- MCR iteration 9 ---- [2020-04-18 11:41:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:19,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2121495760, now seen corresponding path program 11 times [2020-04-18 11:41:19,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:19,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862172422] [2020-04-18 11:41:19,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:19,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862172422] [2020-04-18 11:41:19,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:19,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 11:41:19,887 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:19,889 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:19,895 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 56 transitions. [2020-04-18 11:41:19,896 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:21,043 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 16 times. [2020-04-18 11:41:21,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-04-18 11:41:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2391, Invalid=22101, Unknown=0, NotChecked=0, Total=24492 [2020-04-18 11:41:21,045 INFO L87 Difference]: Start difference. First operand 278 states and 419 transitions. Second operand 32 states. [2020-04-18 11:41:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:24,801 INFO L93 Difference]: Finished difference Result 278 states and 419 transitions. [2020-04-18 11:41:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 419 transitions. [2020-04-18 11:41:24,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:41:24,804 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1614228097] [2020-04-18 11:41:24,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:41:24,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-04-18 11:41:24,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1614228097] [2020-04-18 11:41:24,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2020-04-18 11:41:24,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:41:24,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2020-04-18 11:41:24,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2561, Invalid=23199, Unknown=0, NotChecked=0, Total=25760 [2020-04-18 11:41:24,806 INFO L87 Difference]: Start difference. First operand 1910 states and 4281 transitions. Second operand 72 states. [2020-04-18 11:41:26,257 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2020-04-18 11:41:26,460 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 37 [2020-04-18 11:41:26,913 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 50 [2020-04-18 11:41:27,899 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 43 [2020-04-18 11:41:28,475 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 56 [2020-04-18 11:41:28,848 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 55 [2020-04-18 11:41:29,111 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2020-04-18 11:41:29,992 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 69 [2020-04-18 11:41:30,316 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2020-04-18 11:41:30,742 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 39 [2020-04-18 11:41:31,421 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 62 [2020-04-18 11:41:32,042 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2020-04-18 11:41:32,664 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 76 [2020-04-18 11:41:33,011 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 58 [2020-04-18 11:41:33,778 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 72 [2020-04-18 11:41:34,079 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 46 [2020-04-18 11:41:34,532 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 45 [2020-04-18 11:41:35,162 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 59 [2020-04-18 11:41:35,693 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 58 [2020-04-18 11:41:36,042 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 48 [2020-04-18 11:41:36,795 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 61 [2020-04-18 11:41:37,563 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 65 [2020-04-18 11:41:38,332 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2020-04-18 11:41:38,841 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 68 [2020-04-18 11:41:39,556 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 48 [2020-04-18 11:41:40,024 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 64 [2020-04-18 11:41:40,829 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 51 [2020-04-18 11:41:47,944 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2020-04-18 11:41:48,386 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2020-04-18 11:41:49,239 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2020-04-18 11:41:49,896 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-04-18 11:41:50,134 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2020-04-18 11:41:50,304 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2020-04-18 11:41:50,573 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2020-04-18 11:41:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:51,031 INFO L93 Difference]: Finished difference Result 3615 states and 8008 transitions. [2020-04-18 11:41:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-04-18 11:41:51,032 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 18 [2020-04-18 11:41:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:41:51,044 INFO L225 Difference]: With dead ends: 3615 [2020-04-18 11:41:51,044 INFO L226 Difference]: Without dead ends: 3615 [2020-04-18 11:41:51,046 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 203 SyntacticMatches, 10 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17825 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=6533, Invalid=40773, Unknown=0, NotChecked=0, Total=47306 [2020-04-18 11:41:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2020-04-18 11:41:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 1956. [2020-04-18 11:41:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2020-04-18 11:41:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 4381 transitions. [2020-04-18 11:41:51,104 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 4381 transitions. Word has length 18 [2020-04-18 11:41:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:41:51,104 INFO L479 AbstractCegarLoop]: Abstraction has 1956 states and 4381 transitions. [2020-04-18 11:41:51,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 72 states. [2020-04-18 11:41:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 4381 transitions. [2020-04-18 11:41:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:51,106 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:41:51,106 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:41:51,106 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:41:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1673974597, now seen corresponding path program 1 times [2020-04-18 11:41:51,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:41:51,107 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [223194226] [2020-04-18 11:41:51,108 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:51,108 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:41:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 11:41:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:41:51,109 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:41:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1673974597, now seen corresponding path program 2 times [2020-04-18 11:41:51,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:51,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96737653] [2020-04-18 11:41:51,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:51,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96737653] [2020-04-18 11:41:51,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:51,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 11:41:51,635 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:51,637 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:51,640 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:41:51,640 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:51,848 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:41:51,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 11:41:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:41:51,849 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 15 states. [2020-04-18 11:41:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:52,880 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-04-18 11:41:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-04-18 11:41:52,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:41:52,881 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [223194226] [2020-04-18 11:41:52,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:41:52,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-04-18 11:41:52,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [223194226] [2020-04-18 11:41:52,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 11:41:52,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:41:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 11:41:52,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:41:52,883 INFO L87 Difference]: Start difference. First operand 1956 states and 4381 transitions. Second operand 15 states. [2020-04-18 11:41:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:55,021 INFO L93 Difference]: Finished difference Result 3189 states and 7096 transitions. [2020-04-18 11:41:55,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 11:41:55,022 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-18 11:41:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:41:55,030 INFO L225 Difference]: With dead ends: 3189 [2020-04-18 11:41:55,031 INFO L226 Difference]: Without dead ends: 3189 [2020-04-18 11:41:55,031 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2020-04-18 11:41:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2020-04-18 11:41:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2007. [2020-04-18 11:41:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2020-04-18 11:41:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 4477 transitions. [2020-04-18 11:41:55,074 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 4477 transitions. Word has length 18 [2020-04-18 11:41:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:41:55,074 INFO L479 AbstractCegarLoop]: Abstraction has 2007 states and 4477 transitions. [2020-04-18 11:41:55,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 11:41:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 4477 transitions. [2020-04-18 11:41:55,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:41:55,076 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:41:55,076 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:41:55,077 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:41:55,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1016512041, now seen corresponding path program 1 times [2020-04-18 11:41:55,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:41:55,077 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1208228513] [2020-04-18 11:41:55,078 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:55,078 INFO L259 McrAutomatonBuilder]: Finished intersection with 93 states and 164 transitions. [2020-04-18 11:41:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2020-04-18 11:41:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:41:55,080 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:41:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash 329424779, now seen corresponding path program 2 times [2020-04-18 11:41:55,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:55,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350978835] [2020-04-18 11:41:55,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:55,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350978835] [2020-04-18 11:41:55,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:55,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:41:55,154 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:55,156 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:55,171 INFO L259 McrAutomatonBuilder]: Finished intersection with 63 states and 104 transitions. [2020-04-18 11:41:55,172 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:55,192 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:41:55,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:41:55,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:41:55,193 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 6 states. [2020-04-18 11:41:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:41:55,382 INFO L93 Difference]: Finished difference Result 105 states and 180 transitions. [2020-04-18 11:41:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 180 transitions. [2020-04-18 11:41:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:41:55,382 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:41:55,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:41:55,383 INFO L82 PathProgramCache]: Analyzing trace with hash 815793611, now seen corresponding path program 3 times [2020-04-18 11:41:55,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:41:55,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319082906] [2020-04-18 11:41:55,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:41:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:41:55,846 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-18 11:41:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:41:56,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319082906] [2020-04-18 11:41:56,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:41:56,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 11:41:56,203 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:41:56,206 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:41:56,219 INFO L259 McrAutomatonBuilder]: Finished intersection with 51 states and 80 transitions. [2020-04-18 11:41:56,219 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:41:58,050 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 22 times. [2020-04-18 11:41:58,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-04-18 11:41:58,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1788, Unknown=0, NotChecked=0, Total=1980 [2020-04-18 11:41:58,051 INFO L87 Difference]: Start difference. First operand 105 states and 180 transitions. Second operand 38 states. [2020-04-18 11:41:58,669 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-04-18 11:42:00,547 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2020-04-18 11:42:00,914 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-04-18 11:42:01,113 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2020-04-18 11:42:01,577 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2020-04-18 11:42:02,038 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2020-04-18 11:42:03,088 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2020-04-18 11:42:03,356 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2020-04-18 11:42:03,685 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2020-04-18 11:42:04,117 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 53 [2020-04-18 11:42:04,879 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 84 [2020-04-18 11:42:05,587 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2020-04-18 11:42:06,247 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 54 [2020-04-18 11:42:06,635 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 60 [2020-04-18 11:42:06,965 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2020-04-18 11:42:07,607 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-04-18 11:42:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:09,766 INFO L93 Difference]: Finished difference Result 147 states and 254 transitions. [2020-04-18 11:42:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 254 transitions. [2020-04-18 11:42:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:42:09,767 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:42:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1932193973, now seen corresponding path program 4 times [2020-04-18 11:42:09,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:09,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004868286] [2020-04-18 11:42:09,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:10,561 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 75 [2020-04-18 11:42:10,767 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-04-18 11:42:10,917 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-04-18 11:42:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:11,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004868286] [2020-04-18 11:42:11,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:11,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 11:42:11,131 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:11,133 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:11,144 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 78 transitions. [2020-04-18 11:42:11,144 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:11,503 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-04-18 11:42:12,442 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-04-18 11:42:12,901 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-04-18 11:42:13,424 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-04-18 11:42:13,878 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-04-18 11:42:13,879 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 20 times. [2020-04-18 11:42:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-04-18 11:42:13,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1264, Invalid=7666, Unknown=0, NotChecked=0, Total=8930 [2020-04-18 11:42:13,881 INFO L87 Difference]: Start difference. First operand 147 states and 254 transitions. Second operand 36 states. [2020-04-18 11:42:14,936 WARN L192 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2020-04-18 11:42:16,743 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2020-04-18 11:42:18,095 WARN L192 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2020-04-18 11:42:18,566 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2020-04-18 11:42:19,516 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 60 [2020-04-18 11:42:20,430 WARN L192 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 80 [2020-04-18 11:42:21,124 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 62 [2020-04-18 11:42:22,949 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 162 DAG size of output: 115 [2020-04-18 11:42:23,483 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2020-04-18 11:42:24,142 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2020-04-18 11:42:25,207 WARN L192 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 69 [2020-04-18 11:42:25,862 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 69 [2020-04-18 11:42:26,432 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2020-04-18 11:42:27,838 WARN L192 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 78 [2020-04-18 11:42:28,521 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2020-04-18 11:42:29,613 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2020-04-18 11:42:29,867 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-04-18 11:42:30,220 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2020-04-18 11:42:31,104 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 Received shutdown request... [2020-04-18 11:42:32,840 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.RuntimeException: de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user. at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.StrategyModuleMcr.getOrConstruct(StrategyModuleMcr.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.StrategyModuleMcr.isCorrect(StrategyModuleMcr.java:64) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user. at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1067) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.Mcr.exploreInterleavings(Mcr.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.Mcr.(Mcr.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.StrategyModuleMcr.getOrConstruct(StrategyModuleMcr.java:126) ... 23 more [2020-04-18 11:42:32,845 INFO L168 Benchmark]: Toolchain (without parser) took 251434.30 ms. Allocated memory was 137.9 MB in the beginning and 430.4 MB in the end (delta: 292.6 MB). Free memory was 99.5 MB in the beginning and 152.9 MB in the end (delta: -53.4 MB). Peak memory consumption was 239.2 MB. Max. memory is 7.1 GB. [2020-04-18 11:42:32,845 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-04-18 11:42:32,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 974.16 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 97.5 MB in the beginning and 129.2 MB in the end (delta: -31.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. [2020-04-18 11:42:32,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.39 ms. Allocated memory is still 201.9 MB. Free memory was 129.2 MB in the beginning and 125.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-04-18 11:42:32,847 INFO L168 Benchmark]: Boogie Preprocessor took 61.78 ms. Allocated memory is still 201.9 MB. Free memory was 125.1 MB in the beginning and 121.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-04-18 11:42:32,847 INFO L168 Benchmark]: RCFGBuilder took 1342.76 ms. Allocated memory was 201.9 MB in the beginning and 233.8 MB in the end (delta: 32.0 MB). Free memory was 121.7 MB in the beginning and 152.4 MB in the end (delta: -30.7 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2020-04-18 11:42:32,848 INFO L168 Benchmark]: TraceAbstraction took 248892.92 ms. Allocated memory was 233.8 MB in the beginning and 430.4 MB in the end (delta: 196.6 MB). Free memory was 152.4 MB in the beginning and 152.9 MB in the end (delta: -504.0 kB). Peak memory consumption was 196.1 MB. Max. memory is 7.1 GB. [2020-04-18 11:42:32,850 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.48 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 974.16 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 97.5 MB in the beginning and 129.2 MB in the end (delta: -31.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 141.39 ms. Allocated memory is still 201.9 MB. Free memory was 129.2 MB in the beginning and 125.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.78 ms. Allocated memory is still 201.9 MB. Free memory was 125.1 MB in the beginning and 121.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1342.76 ms. Allocated memory was 201.9 MB in the beginning and 233.8 MB in the end (delta: 32.0 MB). Free memory was 121.7 MB in the beginning and 152.4 MB in the end (delta: -30.7 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248892.92 ms. Allocated memory was 233.8 MB in the beginning and 430.4 MB in the end (delta: 196.6 MB). Free memory was 152.4 MB in the beginning and 152.9 MB in the end (delta: -504.0 kB). Peak memory consumption was 196.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 25.0s, 415 ProgramPointsBefore, 104 ProgramPointsAfterwards, 443 TransitionsBefore, 121 TransitionsAfterwards, 30326 CoEnabledTransitionPairs, 14 FixpointIterations, 120 TrivialSequentialCompositions, 233 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 76 ConcurrentYvCompositions, 11 ChoiceCompositions, 15998 VarBasedMoverChecksPositive, 666 VarBasedMoverChecksNegative, 514 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.4s, 0 MoverChecksTotal, 106197 CheckedPairsTotal, 459 TotalNumberOfCompositions - ExceptionOrErrorResult: RuntimeException: de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: RuntimeException: de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user.: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.StrategyModuleMcr.getOrConstruct(StrategyModuleMcr.java:128) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown