/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:13:55,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:13:55,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:13:55,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:13:55,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:13:55,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:13:55,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:13:55,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:13:55,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:13:55,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:13:55,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:13:55,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:13:55,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:13:55,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:13:55,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:13:55,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:13:55,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:13:55,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:13:55,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:13:55,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:13:55,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:13:55,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:13:55,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:13:55,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:13:55,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:13:55,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:13:55,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:13:55,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:13:55,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:13:55,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:13:55,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:13:55,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:13:55,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:13:55,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:13:55,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:13:55,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:13:55,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:13:55,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:13:55,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:13:55,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:13:55,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:13:55,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 23:13:55,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:13:55,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:13:55,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:13:55,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:13:55,235 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:13:55,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:13:55,236 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:13:55,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:13:55,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:13:55,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:13:55,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:13:55,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:13:55,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:13:55,238 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:13:55,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:13:55,239 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:13:55,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:13:55,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:13:55,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:13:55,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:13:55,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:13:55,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:13:55,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:13:55,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:13:55,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:13:55,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:13:55,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:13:55,241 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:13:55,241 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:13:55,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:13:55,242 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:13:55,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:13:55,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:13:55,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:13:55,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:13:55,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:13:55,550 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:13:55,551 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2019-12-27 23:13:55,622 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbfe3fdf/c7a955edf9724568936d70d57f125daf/FLAG225565573 [2019-12-27 23:13:56,115 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:13:56,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2019-12-27 23:13:56,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbfe3fdf/c7a955edf9724568936d70d57f125daf/FLAG225565573 [2019-12-27 23:13:56,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbfe3fdf/c7a955edf9724568936d70d57f125daf [2019-12-27 23:13:56,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:13:56,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:13:56,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:13:56,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:13:56,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:13:56,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:13:56" (1/1) ... [2019-12-27 23:13:56,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de432cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:56, skipping insertion in model container [2019-12-27 23:13:56,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:13:56" (1/1) ... [2019-12-27 23:13:56,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:13:56,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:13:56,760 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 23:13:57,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:13:57,188 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:13:57,200 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 23:13:57,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:13:57,405 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:13:57,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57 WrapperNode [2019-12-27 23:13:57,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:13:57,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:13:57,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:13:57,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:13:57,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... [2019-12-27 23:13:57,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... [2019-12-27 23:13:57,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:13:57,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:13:57,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:13:57,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:13:57,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... [2019-12-27 23:13:57,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... [2019-12-27 23:13:57,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... [2019-12-27 23:13:57,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... [2019-12-27 23:13:57,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... [2019-12-27 23:13:57,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... [2019-12-27 23:13:57,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... [2019-12-27 23:13:57,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:13:57,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:13:57,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:13:57,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:13:57,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:13:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2019-12-27 23:13:57,696 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2019-12-27 23:13:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:13:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-27 23:13:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:13:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 23:13:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:13:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 23:13:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 23:13:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:13:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:13:57,699 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:13:58,759 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:13:58,760 INFO L287 CfgBuilder]: Removed 40 assume(true) statements. [2019-12-27 23:13:58,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:13:58 BoogieIcfgContainer [2019-12-27 23:13:58,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:13:58,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:13:58,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:13:58,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:13:58,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:13:56" (1/3) ... [2019-12-27 23:13:58,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341c1060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:13:58, skipping insertion in model container [2019-12-27 23:13:58,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:13:57" (2/3) ... [2019-12-27 23:13:58,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341c1060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:13:58, skipping insertion in model container [2019-12-27 23:13:58,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:13:58" (3/3) ... [2019-12-27 23:13:58,770 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2019-12-27 23:13:58,781 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:13:58,781 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:13:58,789 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-12-27 23:13:58,790 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:13:58,833 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,833 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,833 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,834 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,834 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,834 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,835 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,835 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,835 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,835 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,835 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,837 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,837 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,837 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,837 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,837 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,838 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,838 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,838 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,838 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,838 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,839 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,839 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,839 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,839 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,839 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,839 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,840 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,840 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,840 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,840 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,840 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,840 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,841 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,841 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,841 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,841 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,841 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,842 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,842 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,842 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,842 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,842 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,842 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,843 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,843 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,843 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,843 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,844 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,844 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,844 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,844 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,844 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,845 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,845 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,845 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,845 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,845 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,846 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,846 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,846 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,846 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,846 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,847 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,847 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,847 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,847 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,847 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,848 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,848 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,848 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,848 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,848 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,849 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,849 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,849 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,849 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,849 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,849 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,850 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,850 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,850 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,850 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,850 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,851 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,851 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,851 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,851 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,851 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,852 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,852 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,852 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,852 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,852 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,853 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,853 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,853 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,853 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,853 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,853 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,854 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,854 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,854 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,854 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,855 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,855 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,855 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,855 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,855 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,855 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,856 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,856 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,856 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,856 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,856 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,857 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,857 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,857 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,857 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,858 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,858 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,858 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,858 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,858 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,858 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,859 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,859 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,859 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,859 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,859 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,860 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,860 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,860 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,860 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,860 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,861 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,861 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,861 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,861 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,861 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,861 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,862 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,862 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,862 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,862 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,863 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,863 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,863 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,863 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,863 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,863 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,864 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,864 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,864 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,864 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,864 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,864 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,865 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,865 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,865 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,865 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,865 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,865 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,866 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,866 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,866 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,866 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,866 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,867 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,867 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,867 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,867 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,867 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,867 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,868 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,868 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,868 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,868 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,868 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,869 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,869 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,869 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,869 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,869 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,870 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,870 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,870 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,870 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,870 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,870 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,874 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,875 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,875 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,875 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,875 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,875 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,876 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,876 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,876 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,876 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,876 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,876 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,877 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,877 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,877 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,877 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,877 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,878 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,878 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,878 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,878 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,878 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,879 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,879 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,879 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,879 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,879 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,879 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,880 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,880 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,880 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,880 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,880 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,881 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,881 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,881 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,881 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,881 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,882 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,882 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,882 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,882 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,882 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,883 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:13:58,904 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-27 23:13:58,926 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:13:58,926 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:13:58,926 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:13:58,926 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:13:58,927 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:13:58,927 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:13:58,927 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:13:58,927 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:13:58,950 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 443 transitions [2019-12-27 23:13:58,952 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions [2019-12-27 23:13:59,183 INFO L132 PetriNetUnfolder]: 32/442 cut-off events. [2019-12-27 23:13:59,183 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 23:13:59,262 INFO L76 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/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2019-12-27 23:13:59,319 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions [2019-12-27 23:13:59,428 INFO L132 PetriNetUnfolder]: 32/442 cut-off events. [2019-12-27 23:13:59,428 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 23:13:59,446 INFO L76 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/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2019-12-27 23:13:59,493 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 30326 [2019-12-27 23:13:59,494 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:14:00,689 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:14:00,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:00,704 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:14:00,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2019-12-27 23:14:01,067 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:14:01,083 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:01,084 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:14:01,085 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2019-12-27 23:14:03,079 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:14:03,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:03,095 INFO L534 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. [2019-12-27 23:14:03,096 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2019-12-27 23:14:07,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:14:07,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:14:07,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:14:08,575 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-12-27 23:14:08,887 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 23:14:09,005 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-27 23:14:09,214 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-12-27 23:14:11,537 WARN L192 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 151 DAG size of output: 144 [2019-12-27 23:14:11,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:14:11,570 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:14:11,580 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:14:13,539 WARN L192 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 136 [2019-12-27 23:14:13,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:13,541 INFO L534 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. [2019-12-27 23:14:13,541 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:585, output treesize:603 [2019-12-27 23:14:15,423 WARN L192 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 140 [2019-12-27 23:14:16,908 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 162 DAG size of output: 140 [2019-12-27 23:14:17,336 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-12-27 23:14:19,237 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 176 DAG size of output: 170 [2019-12-27 23:14:19,259 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:14:19,986 WARN L192 SmtUtils]: Spent 726.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 23:14:19,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:19,988 INFO L534 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. [2019-12-27 23:14:19,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2019-12-27 23:14:20,676 WARN L192 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 23:14:20,743 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79514 [2019-12-27 23:14:20,743 INFO L214 etLargeBlockEncoding]: Total number of compositions: 428 [2019-12-27 23:14:20,746 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 124 transitions [2019-12-27 23:14:20,814 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1471 states. [2019-12-27 23:14:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states. [2019-12-27 23:14:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 23:14:20,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:20,825 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 23:14:20,825 INFO L410 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]=== [2019-12-27 23:14:20,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1563, now seen corresponding path program 1 times [2019-12-27 23:14:20,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:20,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631053113] [2019-12-27 23:14:20,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:20,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631053113] [2019-12-27 23:14:20,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:20,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 23:14:20,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [905919281] [2019-12-27 23:14:20,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:20,983 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:20,992 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 2 states and 1 transitions. [2019-12-27 23:14:20,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:20,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:14:21,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 23:14:21,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 23:14:21,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 23:14:21,013 INFO L87 Difference]: Start difference. First operand 1471 states. Second operand 2 states. [2019-12-27 23:14:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:21,071 INFO L93 Difference]: Finished difference Result 1470 states and 3278 transitions. [2019-12-27 23:14:21,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 23:14:21,073 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 23:14:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:21,100 INFO L225 Difference]: With dead ends: 1470 [2019-12-27 23:14:21,101 INFO L226 Difference]: Without dead ends: 1412 [2019-12-27 23:14:21,102 INFO L631 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 [2019-12-27 23:14:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-12-27 23:14:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-12-27 23:14:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-12-27 23:14:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3157 transitions. [2019-12-27 23:14:21,249 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3157 transitions. Word has length 1 [2019-12-27 23:14:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:21,250 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 3157 transitions. [2019-12-27 23:14:21,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 23:14:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3157 transitions. [2019-12-27 23:14:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 23:14:21,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:21,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 23:14:21,251 INFO L410 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]=== [2019-12-27 23:14:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1480366744, now seen corresponding path program 1 times [2019-12-27 23:14:21,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:21,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790284882] [2019-12-27 23:14:21,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:21,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790284882] [2019-12-27 23:14:21,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:21,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:14:21,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1523364506] [2019-12-27 23:14:21,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:21,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:21,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 7 states and 6 transitions. [2019-12-27 23:14:21,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:21,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:14:21,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:14:21,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:14:21,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:14:21,381 INFO L87 Difference]: Start difference. First operand 1412 states and 3157 transitions. Second operand 3 states. [2019-12-27 23:14:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:21,470 INFO L93 Difference]: Finished difference Result 2647 states and 5928 transitions. [2019-12-27 23:14:21,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:14:21,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 23:14:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:21,492 INFO L225 Difference]: With dead ends: 2647 [2019-12-27 23:14:21,492 INFO L226 Difference]: Without dead ends: 2647 [2019-12-27 23:14:21,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:14:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-12-27 23:14:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1431. [2019-12-27 23:14:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-12-27 23:14:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3197 transitions. [2019-12-27 23:14:21,554 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3197 transitions. Word has length 6 [2019-12-27 23:14:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:21,555 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 3197 transitions. [2019-12-27 23:14:21,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:14:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3197 transitions. [2019-12-27 23:14:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 23:14:21,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:21,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:21,557 INFO L410 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]=== [2019-12-27 23:14:21,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:21,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1351057285, now seen corresponding path program 1 times [2019-12-27 23:14:21,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:21,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652162658] [2019-12-27 23:14:21,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:21,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652162658] [2019-12-27 23:14:21,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:21,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:14:21,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [355375556] [2019-12-27 23:14:21,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:21,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:21,712 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 23:14:21,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:21,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:14:21,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:14:21,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:21,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:14:21,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:14:21,713 INFO L87 Difference]: Start difference. First operand 1431 states and 3197 transitions. Second operand 3 states. [2019-12-27 23:14:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:21,731 INFO L93 Difference]: Finished difference Result 1431 states and 3178 transitions. [2019-12-27 23:14:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:14:21,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 23:14:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:21,740 INFO L225 Difference]: With dead ends: 1431 [2019-12-27 23:14:21,740 INFO L226 Difference]: Without dead ends: 1431 [2019-12-27 23:14:21,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:14:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-27 23:14:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2019-12-27 23:14:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-12-27 23:14:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3178 transitions. [2019-12-27 23:14:21,781 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3178 transitions. Word has length 7 [2019-12-27 23:14:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:21,781 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 3178 transitions. [2019-12-27 23:14:21,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:14:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3178 transitions. [2019-12-27 23:14:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 23:14:21,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:21,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:21,783 INFO L410 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]=== [2019-12-27 23:14:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:21,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1061393396, now seen corresponding path program 1 times [2019-12-27 23:14:21,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:21,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557378137] [2019-12-27 23:14:21,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:21,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557378137] [2019-12-27 23:14:21,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:21,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:14:21,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1393524570] [2019-12-27 23:14:21,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:21,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:21,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 23:14:21,966 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:21,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:14:21,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:14:21,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:21,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:14:21,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:14:21,967 INFO L87 Difference]: Start difference. First operand 1431 states and 3178 transitions. Second operand 6 states. [2019-12-27 23:14:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:22,612 INFO L93 Difference]: Finished difference Result 1817 states and 4039 transitions. [2019-12-27 23:14:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:14:22,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-27 23:14:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:22,623 INFO L225 Difference]: With dead ends: 1817 [2019-12-27 23:14:22,623 INFO L226 Difference]: Without dead ends: 1817 [2019-12-27 23:14:22,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:14:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2019-12-27 23:14:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1538. [2019-12-27 23:14:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-12-27 23:14:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 3423 transitions. [2019-12-27 23:14:22,668 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 3423 transitions. Word has length 8 [2019-12-27 23:14:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:22,668 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 3423 transitions. [2019-12-27 23:14:22,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:14:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 3423 transitions. [2019-12-27 23:14:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 23:14:22,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:22,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:22,672 INFO L410 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]=== [2019-12-27 23:14:22,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2091400192, now seen corresponding path program 1 times [2019-12-27 23:14:22,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:22,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241168920] [2019-12-27 23:14:22,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:22,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241168920] [2019-12-27 23:14:22,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:22,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:14:22,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1334764819] [2019-12-27 23:14:22,743 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:22,744 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:22,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 23:14:22,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:22,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:14:22,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:14:22,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:14:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:14:22,746 INFO L87 Difference]: Start difference. First operand 1538 states and 3423 transitions. Second operand 3 states. [2019-12-27 23:14:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:22,835 INFO L93 Difference]: Finished difference Result 2508 states and 5570 transitions. [2019-12-27 23:14:22,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:14:22,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 23:14:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:22,851 INFO L225 Difference]: With dead ends: 2508 [2019-12-27 23:14:22,851 INFO L226 Difference]: Without dead ends: 2508 [2019-12-27 23:14:22,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:14:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-12-27 23:14:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1595. [2019-12-27 23:14:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-27 23:14:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3543 transitions. [2019-12-27 23:14:22,905 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3543 transitions. Word has length 10 [2019-12-27 23:14:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:22,906 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3543 transitions. [2019-12-27 23:14:22,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:14:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3543 transitions. [2019-12-27 23:14:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:14:22,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:22,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:22,908 INFO L410 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]=== [2019-12-27 23:14:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1386351339, now seen corresponding path program 1 times [2019-12-27 23:14:22,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:22,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692950957] [2019-12-27 23:14:22,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:23,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692950957] [2019-12-27 23:14:23,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:23,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 23:14:23,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1796763956] [2019-12-27 23:14:23,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:23,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:23,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 38 transitions. [2019-12-27 23:14:23,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:23,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:14:23,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:14:23,084 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:14:23,085 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:18 [2019-12-27 23:14:23,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:14:23,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:14:23,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:23,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:14:23,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:14:23,354 INFO L87 Difference]: Start difference. First operand 1595 states and 3543 transitions. Second operand 17 states. [2019-12-27 23:14:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:29,305 INFO L93 Difference]: Finished difference Result 2108 states and 4575 transitions. [2019-12-27 23:14:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 23:14:29,306 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-12-27 23:14:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:29,318 INFO L225 Difference]: With dead ends: 2108 [2019-12-27 23:14:29,319 INFO L226 Difference]: Without dead ends: 2108 [2019-12-27 23:14:29,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:14:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2019-12-27 23:14:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1604. [2019-12-27 23:14:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-27 23:14:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3563 transitions. [2019-12-27 23:14:29,368 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3563 transitions. Word has length 14 [2019-12-27 23:14:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:29,369 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3563 transitions. [2019-12-27 23:14:29,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:14:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3563 transitions. [2019-12-27 23:14:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:14:29,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:29,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:29,372 INFO L410 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]=== [2019-12-27 23:14:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash 543557020, now seen corresponding path program 1 times [2019-12-27 23:14:29,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:29,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428680068] [2019-12-27 23:14:29,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:29,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428680068] [2019-12-27 23:14:29,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:29,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:14:29,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339035180] [2019-12-27 23:14:29,516 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:29,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:29,520 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 23:14:29,520 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:29,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:14:29,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:14:29,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:29,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:14:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:14:29,522 INFO L87 Difference]: Start difference. First operand 1604 states and 3563 transitions. Second operand 8 states. [2019-12-27 23:14:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:30,655 INFO L93 Difference]: Finished difference Result 2382 states and 5288 transitions. [2019-12-27 23:14:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:14:30,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-27 23:14:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:30,666 INFO L225 Difference]: With dead ends: 2382 [2019-12-27 23:14:30,666 INFO L226 Difference]: Without dead ends: 2345 [2019-12-27 23:14:30,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:14:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2019-12-27 23:14:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1762. [2019-12-27 23:14:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2019-12-27 23:14:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 3963 transitions. [2019-12-27 23:14:30,711 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 3963 transitions. Word has length 14 [2019-12-27 23:14:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:30,712 INFO L462 AbstractCegarLoop]: Abstraction has 1762 states and 3963 transitions. [2019-12-27 23:14:30,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:14:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 3963 transitions. [2019-12-27 23:14:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:14:30,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:30,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:30,713 INFO L410 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]=== [2019-12-27 23:14:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:30,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1986901861, now seen corresponding path program 1 times [2019-12-27 23:14:30,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:30,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840057978] [2019-12-27 23:14:30,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:30,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840057978] [2019-12-27 23:14:30,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:30,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:14:30,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453010782] [2019-12-27 23:14:30,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:30,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:30,880 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 63 transitions. [2019-12-27 23:14:30,880 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:31,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:14:31,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 23:14:31,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:31,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 23:14:31,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:14:31,304 INFO L87 Difference]: Start difference. First operand 1762 states and 3963 transitions. Second operand 20 states. [2019-12-27 23:14:32,723 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-12-27 23:14:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:37,180 INFO L93 Difference]: Finished difference Result 2167 states and 4735 transitions. [2019-12-27 23:14:37,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:14:37,180 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-12-27 23:14:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:37,190 INFO L225 Difference]: With dead ends: 2167 [2019-12-27 23:14:37,190 INFO L226 Difference]: Without dead ends: 2167 [2019-12-27 23:14:37,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:14:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2019-12-27 23:14:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1741. [2019-12-27 23:14:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-12-27 23:14:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 3899 transitions. [2019-12-27 23:14:37,232 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 3899 transitions. Word has length 15 [2019-12-27 23:14:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:37,233 INFO L462 AbstractCegarLoop]: Abstraction has 1741 states and 3899 transitions. [2019-12-27 23:14:37,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 23:14:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 3899 transitions. [2019-12-27 23:14:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:14:37,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:37,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:37,234 INFO L410 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]=== [2019-12-27 23:14:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1857945271, now seen corresponding path program 2 times [2019-12-27 23:14:37,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:37,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194810257] [2019-12-27 23:14:37,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:37,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194810257] [2019-12-27 23:14:37,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:37,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:14:37,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1369603968] [2019-12-27 23:14:37,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:37,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:37,597 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 51 transitions. [2019-12-27 23:14:37,597 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:38,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:14:38,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 23:14:38,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:38,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 23:14:38,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:14:38,240 INFO L87 Difference]: Start difference. First operand 1741 states and 3899 transitions. Second operand 23 states. [2019-12-27 23:14:38,781 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-12-27 23:14:39,336 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-12-27 23:14:39,714 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-12-27 23:14:39,906 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-12-27 23:14:40,202 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-12-27 23:14:41,238 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-12-27 23:14:41,520 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-12-27 23:14:42,165 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-12-27 23:14:42,624 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-12-27 23:14:43,240 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2019-12-27 23:14:49,590 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-12-27 23:14:50,376 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-12-27 23:14:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:14:51,797 INFO L93 Difference]: Finished difference Result 2705 states and 5804 transitions. [2019-12-27 23:14:51,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:14:51,797 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 15 [2019-12-27 23:14:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:14:51,811 INFO L225 Difference]: With dead ends: 2705 [2019-12-27 23:14:51,811 INFO L226 Difference]: Without dead ends: 2705 [2019-12-27 23:14:51,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=667, Invalid=2413, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 23:14:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2019-12-27 23:14:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 1765. [2019-12-27 23:14:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-12-27 23:14:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 3955 transitions. [2019-12-27 23:14:51,855 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 3955 transitions. Word has length 15 [2019-12-27 23:14:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:14:51,856 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 3955 transitions. [2019-12-27 23:14:51,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 23:14:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 3955 transitions. [2019-12-27 23:14:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:14:51,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:14:51,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:14:51,857 INFO L410 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]=== [2019-12-27 23:14:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:14:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash 91041061, now seen corresponding path program 3 times [2019-12-27 23:14:51,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:14:51,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288703483] [2019-12-27 23:14:51,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:14:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:14:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:14:52,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288703483] [2019-12-27 23:14:52,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:14:52,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 23:14:52,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [436793906] [2019-12-27 23:14:52,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:14:52,141 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:14:52,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 43 transitions. [2019-12-27 23:14:52,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:14:52,456 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:14:52,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 23:14:52,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:14:52,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 23:14:52,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:14:52,458 INFO L87 Difference]: Start difference. First operand 1765 states and 3955 transitions. Second operand 22 states. [2019-12-27 23:14:53,483 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2019-12-27 23:14:53,959 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 78 [2019-12-27 23:14:54,593 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 80 [2019-12-27 23:14:54,860 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2019-12-27 23:14:55,450 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 88 [2019-12-27 23:14:55,644 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 72 [2019-12-27 23:14:55,811 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 56 [2019-12-27 23:14:56,258 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2019-12-27 23:14:56,438 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2019-12-27 23:14:56,614 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 58 [2019-12-27 23:14:57,033 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 58 [2019-12-27 23:14:57,759 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2019-12-27 23:14:58,283 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 83 [2019-12-27 23:14:58,745 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 91 [2019-12-27 23:14:59,315 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 77 [2019-12-27 23:14:59,512 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 61 [2019-12-27 23:14:59,848 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 61 [2019-12-27 23:15:00,034 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 57 [2019-12-27 23:15:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:15:05,455 INFO L93 Difference]: Finished difference Result 2720 states and 5936 transitions. [2019-12-27 23:15:05,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 23:15:05,456 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 15 [2019-12-27 23:15:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:15:05,470 INFO L225 Difference]: With dead ends: 2720 [2019-12-27 23:15:05,471 INFO L226 Difference]: Without dead ends: 2720 [2019-12-27 23:15:05,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1093, Invalid=3463, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 23:15:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-12-27 23:15:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1769. [2019-12-27 23:15:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2019-12-27 23:15:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 3963 transitions. [2019-12-27 23:15:05,516 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 3963 transitions. Word has length 15 [2019-12-27 23:15:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:15:05,516 INFO L462 AbstractCegarLoop]: Abstraction has 1769 states and 3963 transitions. [2019-12-27 23:15:05,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 23:15:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 3963 transitions. [2019-12-27 23:15:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:15:05,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:15:05,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:15:05,518 INFO L410 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]=== [2019-12-27 23:15:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:15:05,518 INFO L82 PathProgramCache]: Analyzing trace with hash 26955317, now seen corresponding path program 1 times [2019-12-27 23:15:05,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:15:05,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043249910] [2019-12-27 23:15:05,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:15:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:15:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:15:05,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043249910] [2019-12-27 23:15:05,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:15:05,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 23:15:05,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [819373868] [2019-12-27 23:15:05,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:15:05,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:15:05,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 23:15:05,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:15:05,768 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:15:05,772 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:15:05,776 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:15:05,787 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 23:15:05,789 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-27 23:15:05,839 INFO L614 ElimStorePlain]: treesize reduction 45, result has 47.1 percent of original size [2019-12-27 23:15:05,840 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 23:15:05,840 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:185, output treesize:40 [2019-12-27 23:15:05,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 23:15:06,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:15:06,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:15:06,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:15:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:15:06,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:15:06,349 INFO L87 Difference]: Start difference. First operand 1769 states and 3963 transitions. Second operand 19 states. [2019-12-27 23:15:06,735 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-27 23:15:07,073 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-12-27 23:15:07,882 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2019-12-27 23:15:08,178 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 58 [2019-12-27 23:15:08,707 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 61 [2019-12-27 23:15:08,919 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-27 23:15:09,562 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2019-12-27 23:15:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:15:14,159 INFO L93 Difference]: Finished difference Result 2502 states and 5456 transitions. [2019-12-27 23:15:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:15:14,160 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-12-27 23:15:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:15:14,166 INFO L225 Difference]: With dead ends: 2502 [2019-12-27 23:15:14,166 INFO L226 Difference]: Without dead ends: 2502 [2019-12-27 23:15:14,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=380, Invalid=1102, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 23:15:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-12-27 23:15:14,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1811. [2019-12-27 23:15:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-12-27 23:15:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 4059 transitions. [2019-12-27 23:15:14,207 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 4059 transitions. Word has length 15 [2019-12-27 23:15:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:15:14,208 INFO L462 AbstractCegarLoop]: Abstraction has 1811 states and 4059 transitions. [2019-12-27 23:15:14,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:15:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 4059 transitions. [2019-12-27 23:15:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:15:14,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:15:14,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:15:14,210 INFO L410 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]=== [2019-12-27 23:15:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:15:14,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1229120985, now seen corresponding path program 1 times [2019-12-27 23:15:14,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:15:14,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77315364] [2019-12-27 23:15:14,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:15:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:15:14,732 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-12-27 23:15:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:15:14,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77315364] [2019-12-27 23:15:14,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:15:14,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 23:15:14,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545998618] [2019-12-27 23:15:14,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:15:14,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:15:14,993 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 55 transitions. [2019-12-27 23:15:14,994 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:15:15,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:15:15,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 23:15:15,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:15:15,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 23:15:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:15:15,894 INFO L87 Difference]: Start difference. First operand 1811 states and 4059 transitions. Second operand 29 states. [2019-12-27 23:15:16,563 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-12-27 23:15:16,905 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-12-27 23:15:17,154 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-12-27 23:15:17,439 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 76 [2019-12-27 23:15:17,641 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 53 [2019-12-27 23:15:17,946 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2019-12-27 23:15:18,226 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 83 [2019-12-27 23:15:18,469 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-12-27 23:15:18,795 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-12-27 23:15:19,376 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 66 [2019-12-27 23:15:19,777 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 94 [2019-12-27 23:15:20,229 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2019-12-27 23:15:20,721 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 108 [2019-12-27 23:15:21,029 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 90 [2019-12-27 23:15:21,311 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2019-12-27 23:15:21,539 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 51 [2019-12-27 23:15:21,814 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 75 [2019-12-27 23:15:22,358 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 114 [2019-12-27 23:15:22,925 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 110 [2019-12-27 23:15:23,474 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 120 [2019-12-27 23:15:24,064 WARN L192 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 117 [2019-12-27 23:15:24,386 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 92 [2019-12-27 23:15:24,621 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 57 [2019-12-27 23:15:24,976 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 64 [2019-12-27 23:15:25,684 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 123 [2019-12-27 23:15:26,125 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 95 [2019-12-27 23:15:26,790 WARN L192 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 129 [2019-12-27 23:15:27,276 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 102 [2019-12-27 23:15:27,485 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2019-12-27 23:15:27,820 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 70 [2019-12-27 23:15:28,164 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 90 [2019-12-27 23:15:28,490 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 82 [2019-12-27 23:15:29,124 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 108 [2019-12-27 23:15:29,431 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 80 [2019-12-27 23:15:29,966 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 114 [2019-12-27 23:15:30,322 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 88 [2019-12-27 23:15:30,537 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-12-27 23:15:31,106 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 101 [2019-12-27 23:15:31,649 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 91 [2019-12-27 23:15:31,998 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 71 [2019-12-27 23:15:32,392 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 94 [2019-12-27 23:15:32,818 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 100 [2019-12-27 23:15:33,014 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-12-27 23:15:33,512 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 64 [2019-12-27 23:15:33,745 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 74 [2019-12-27 23:15:34,067 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 96 [2019-12-27 23:15:34,423 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 95 [2019-12-27 23:15:34,826 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-12-27 23:15:35,173 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 67 [2019-12-27 23:15:35,490 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2019-12-27 23:15:35,802 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-27 23:15:36,237 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 101 [2019-12-27 23:15:36,556 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 98 [2019-12-27 23:15:37,084 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2019-12-27 23:15:37,419 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 82 [2019-12-27 23:15:37,831 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 93 [2019-12-27 23:15:38,136 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 77 [2019-12-27 23:15:38,442 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 88 [2019-12-27 23:15:38,816 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 100 [2019-12-27 23:15:39,178 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 104 [2019-12-27 23:15:39,484 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 68 [2019-12-27 23:15:40,135 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 65 [2019-12-27 23:15:40,461 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 85 [2019-12-27 23:15:40,759 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2019-12-27 23:15:41,080 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 96 [2019-12-27 23:15:41,360 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-12-27 23:15:41,610 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 76 [2019-12-27 23:15:41,923 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 92 [2019-12-27 23:15:42,308 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 103 [2019-12-27 23:15:42,629 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 71 [2019-12-27 23:15:43,038 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 101 [2019-12-27 23:15:43,726 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 90 [2019-12-27 23:15:44,090 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 60 [2019-12-27 23:15:44,310 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-12-27 23:15:44,588 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 79 [2019-12-27 23:15:45,018 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 93 [2019-12-27 23:15:45,476 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 104 [2019-12-27 23:15:45,806 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-27 23:15:46,024 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-27 23:15:46,463 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 93 [2019-12-27 23:15:47,107 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 103 [2019-12-27 23:15:47,474 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-12-27 23:15:48,142 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 95 [2019-12-27 23:15:48,734 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-12-27 23:15:48,928 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-12-27 23:15:49,796 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-12-27 23:15:50,536 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-12-27 23:15:51,474 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-12-27 23:15:51,755 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-12-27 23:15:52,719 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-27 23:15:55,737 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-12-27 23:16:00,749 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-12-27 23:16:01,702 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-12-27 23:16:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:16:03,518 INFO L93 Difference]: Finished difference Result 4024 states and 8783 transitions. [2019-12-27 23:16:03,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-12-27 23:16:03,519 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 17 [2019-12-27 23:16:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:16:03,532 INFO L225 Difference]: With dead ends: 4024 [2019-12-27 23:16:03,532 INFO L226 Difference]: Without dead ends: 4024 [2019-12-27 23:16:03,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7617 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=3256, Invalid=18796, Unknown=0, NotChecked=0, Total=22052 [2019-12-27 23:16:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-12-27 23:16:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 1963. [2019-12-27 23:16:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 23:16:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4437 transitions. [2019-12-27 23:16:03,592 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4437 transitions. Word has length 17 [2019-12-27 23:16:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:16:03,596 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4437 transitions. [2019-12-27 23:16:03,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 23:16:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4437 transitions. [2019-12-27 23:16:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:16:03,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:16:03,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:16:03,598 INFO L410 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]=== [2019-12-27 23:16:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:16:03,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1637353785, now seen corresponding path program 2 times [2019-12-27 23:16:03,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:16:03,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001034344] [2019-12-27 23:16:03,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:16:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:16:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:16:04,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001034344] [2019-12-27 23:16:04,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:16:04,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:16:04,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250204615] [2019-12-27 23:16:04,081 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:16:04,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:16:04,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 23:16:04,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:16:04,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:16:04,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 23:16:04,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:16:04,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 23:16:04,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:16:04,703 INFO L87 Difference]: Start difference. First operand 1963 states and 4437 transitions. Second operand 29 states. [2019-12-27 23:16:05,266 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-12-27 23:16:05,591 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 58 [2019-12-27 23:16:05,943 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-12-27 23:16:06,122 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 53 [2019-12-27 23:16:06,298 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2019-12-27 23:16:06,564 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 83 [2019-12-27 23:16:06,754 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2019-12-27 23:16:07,248 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 58 [2019-12-27 23:16:07,546 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 83 [2019-12-27 23:16:07,834 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 92 [2019-12-27 23:16:08,221 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 51 [2019-12-27 23:16:08,449 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 62 [2019-12-27 23:16:08,802 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-12-27 23:16:09,058 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 78 [2019-12-27 23:16:09,290 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 64 [2019-12-27 23:16:09,550 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 56 [2019-12-27 23:16:09,874 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 77 [2019-12-27 23:16:10,084 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 61 [2019-12-27 23:16:10,341 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 69 [2019-12-27 23:16:10,559 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 67 [2019-12-27 23:16:10,924 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 63 [2019-12-27 23:16:11,165 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 66 [2019-12-27 23:16:11,796 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 63 [2019-12-27 23:16:12,203 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 61 [2019-12-27 23:16:12,501 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 86 [2019-12-27 23:16:13,095 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 97 [2019-12-27 23:16:13,556 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 59 [2019-12-27 23:16:13,884 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 80 [2019-12-27 23:16:14,170 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 72 [2019-12-27 23:16:14,712 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 66 [2019-12-27 23:16:14,980 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 69 [2019-12-27 23:16:19,788 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 77 [2019-12-27 23:16:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:16:24,943 INFO L93 Difference]: Finished difference Result 3450 states and 7614 transitions. [2019-12-27 23:16:24,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 23:16:24,943 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 17 [2019-12-27 23:16:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:16:24,951 INFO L225 Difference]: With dead ends: 3450 [2019-12-27 23:16:24,951 INFO L226 Difference]: Without dead ends: 3450 [2019-12-27 23:16:24,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1303, Invalid=6007, Unknown=0, NotChecked=0, Total=7310 [2019-12-27 23:16:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2019-12-27 23:16:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 1970. [2019-12-27 23:16:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-12-27 23:16:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4453 transitions. [2019-12-27 23:16:24,999 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 4453 transitions. Word has length 17 [2019-12-27 23:16:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:16:25,000 INFO L462 AbstractCegarLoop]: Abstraction has 1970 states and 4453 transitions. [2019-12-27 23:16:25,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 23:16:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 4453 transitions. [2019-12-27 23:16:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:16:25,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:16:25,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:16:25,002 INFO L410 AbstractCegarLoop]: === Iteration 14 === [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]=== [2019-12-27 23:16:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:16:25,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1582982421, now seen corresponding path program 3 times [2019-12-27 23:16:25,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:16:25,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44414340] [2019-12-27 23:16:25,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:16:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:16:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:16:25,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44414340] [2019-12-27 23:16:25,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:16:25,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 23:16:25,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757412642] [2019-12-27 23:16:25,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:16:25,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:16:25,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 23:16:25,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:16:25,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:16:25,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 23:16:25,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:16:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 23:16:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:16:25,910 INFO L87 Difference]: Start difference. First operand 1970 states and 4453 transitions. Second operand 28 states. [2019-12-27 23:16:26,577 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2019-12-27 23:16:26,912 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 58 [2019-12-27 23:16:27,151 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2019-12-27 23:16:27,320 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 53 [2019-12-27 23:16:27,593 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 83 [2019-12-27 23:16:27,804 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-12-27 23:16:28,329 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 84 [2019-12-27 23:16:28,624 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 92 [2019-12-27 23:16:29,019 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 51 [2019-12-27 23:16:29,283 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 79 [2019-12-27 23:16:29,607 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 109 [2019-12-27 23:16:29,866 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 77 [2019-12-27 23:16:30,086 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 64 [2019-12-27 23:16:30,580 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 118 [2019-12-27 23:16:30,789 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2019-12-27 23:16:31,013 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 63 [2019-12-27 23:16:31,327 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 77 [2019-12-27 23:16:31,712 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 103 [2019-12-27 23:16:32,024 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 90 [2019-12-27 23:16:32,222 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 65 [2019-12-27 23:16:32,693 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 90 [2019-12-27 23:16:33,251 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 61 [2019-12-27 23:16:33,792 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 56 [2019-12-27 23:16:34,080 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 86 [2019-12-27 23:16:34,765 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 95 [2019-12-27 23:16:35,385 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 54 [2019-12-27 23:16:35,705 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 80 [2019-12-27 23:16:35,959 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 67 [2019-12-27 23:16:36,602 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 67 [2019-12-27 23:16:36,843 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 66 [2019-12-27 23:16:37,265 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 68 [2019-12-27 23:16:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:16:46,678 INFO L93 Difference]: Finished difference Result 3831 states and 8453 transitions. [2019-12-27 23:16:46,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-27 23:16:46,678 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 17 [2019-12-27 23:16:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:16:46,685 INFO L225 Difference]: With dead ends: 3831 [2019-12-27 23:16:46,685 INFO L226 Difference]: Without dead ends: 3831 [2019-12-27 23:16:46,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2271 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1345, Invalid=7211, Unknown=0, NotChecked=0, Total=8556 [2019-12-27 23:16:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2019-12-27 23:16:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 1953. [2019-12-27 23:16:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2019-12-27 23:16:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 4413 transitions. [2019-12-27 23:16:46,733 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 4413 transitions. Word has length 17 [2019-12-27 23:16:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:16:46,733 INFO L462 AbstractCegarLoop]: Abstraction has 1953 states and 4413 transitions. [2019-12-27 23:16:46,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 23:16:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 4413 transitions. [2019-12-27 23:16:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:16:46,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:16:46,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:16:46,735 INFO L410 AbstractCegarLoop]: === Iteration 15 === [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]=== [2019-12-27 23:16:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:16:46,735 INFO L82 PathProgramCache]: Analyzing trace with hash -165055423, now seen corresponding path program 1 times [2019-12-27 23:16:46,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:16:46,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197848000] [2019-12-27 23:16:46,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:16:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:16:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:16:46,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197848000] [2019-12-27 23:16:46,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:16:46,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 23:16:46,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268168369] [2019-12-27 23:16:46,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:16:46,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:16:46,930 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 42 transitions. [2019-12-27 23:16:46,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:16:46,936 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:16:46,938 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:16:46,940 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:16:46,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:16:46,948 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 23:16:46,948 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:133, output treesize:70 [2019-12-27 23:16:46,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 23:16:47,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:16:47,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:16:47,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:16:47,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:16:47,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:16:47,461 INFO L87 Difference]: Start difference. First operand 1953 states and 4413 transitions. Second operand 16 states. [2019-12-27 23:16:47,927 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-12-27 23:16:48,311 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-12-27 23:16:49,218 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-12-27 23:16:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:16:54,276 INFO L93 Difference]: Finished difference Result 2425 states and 5333 transitions. [2019-12-27 23:16:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:16:54,277 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-27 23:16:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:16:54,280 INFO L225 Difference]: With dead ends: 2425 [2019-12-27 23:16:54,280 INFO L226 Difference]: Without dead ends: 2425 [2019-12-27 23:16:54,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:16:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2019-12-27 23:16:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1951. [2019-12-27 23:16:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2019-12-27 23:16:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 4407 transitions. [2019-12-27 23:16:54,328 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 4407 transitions. Word has length 18 [2019-12-27 23:16:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:16:54,328 INFO L462 AbstractCegarLoop]: Abstraction has 1951 states and 4407 transitions. [2019-12-27 23:16:54,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:16:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 4407 transitions. [2019-12-27 23:16:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:16:54,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:16:54,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:16:54,330 INFO L410 AbstractCegarLoop]: === Iteration 16 === [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]=== [2019-12-27 23:16:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:16:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1829286343, now seen corresponding path program 2 times [2019-12-27 23:16:54,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:16:54,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550302900] [2019-12-27 23:16:54,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:16:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:16:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:16:54,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550302900] [2019-12-27 23:16:54,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:16:54,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 23:16:54,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536817984] [2019-12-27 23:16:54,499 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:16:54,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:16:54,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 42 transitions. [2019-12-27 23:16:54,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:16:54,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:16:54,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:16:54,520 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:16:54,522 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 23:16:54,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:16:54,531 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-27 23:16:54,531 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:158, output treesize:74 [2019-12-27 23:16:54,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 23:16:55,021 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 23:16:55,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:16:55,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:16:55,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:16:55,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:16:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:16:55,181 INFO L87 Difference]: Start difference. First operand 1951 states and 4407 transitions. Second operand 16 states. [2019-12-27 23:16:55,731 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-12-27 23:16:56,009 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-27 23:16:56,335 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-12-27 23:16:56,548 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-12-27 23:16:57,192 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 59 [2019-12-27 23:16:57,465 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 64 [2019-12-27 23:16:57,881 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 78 [2019-12-27 23:17:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:17:03,465 INFO L93 Difference]: Finished difference Result 2542 states and 5574 transitions. [2019-12-27 23:17:03,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:17:03,466 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-27 23:17:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:17:03,469 INFO L225 Difference]: With dead ends: 2542 [2019-12-27 23:17:03,469 INFO L226 Difference]: Without dead ends: 2542 [2019-12-27 23:17:03,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:17:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2019-12-27 23:17:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 1955. [2019-12-27 23:17:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2019-12-27 23:17:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 4413 transitions. [2019-12-27 23:17:03,497 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 4413 transitions. Word has length 18 [2019-12-27 23:17:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:17:03,497 INFO L462 AbstractCegarLoop]: Abstraction has 1955 states and 4413 transitions. [2019-12-27 23:17:03,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:17:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 4413 transitions. [2019-12-27 23:17:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:17:03,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:03,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:17:03,499 INFO L410 AbstractCegarLoop]: === Iteration 17 === [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]=== [2019-12-27 23:17:03,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash 701793109, now seen corresponding path program 3 times [2019-12-27 23:17:03,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:03,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560561048] [2019-12-27 23:17:03,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:17:03,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560561048] [2019-12-27 23:17:03,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:17:03,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 23:17:03,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164842368] [2019-12-27 23:17:03,811 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:03,813 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:03,818 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 42 transitions. [2019-12-27 23:17:03,818 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:03,822 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:03,823 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:03,826 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:03,828 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:03,846 INFO L614 ElimStorePlain]: treesize reduction 4, result has 90.9 percent of original size [2019-12-27 23:17:03,846 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 23:17:03,846 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:128, output treesize:40 [2019-12-27 23:17:03,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:04,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:17:04,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 23:17:04,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:04,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 23:17:04,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:17:04,237 INFO L87 Difference]: Start difference. First operand 1955 states and 4413 transitions. Second operand 21 states. [2019-12-27 23:17:04,601 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 23:17:05,991 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-12-27 23:17:06,442 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-12-27 23:17:07,095 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2019-12-27 23:17:07,290 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-12-27 23:17:07,694 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-12-27 23:17:08,208 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-12-27 23:17:08,599 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2019-12-27 23:17:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:17:14,354 INFO L93 Difference]: Finished difference Result 2693 states and 5899 transitions. [2019-12-27 23:17:14,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 23:17:14,354 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 18 [2019-12-27 23:17:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:17:14,358 INFO L225 Difference]: With dead ends: 2693 [2019-12-27 23:17:14,358 INFO L226 Difference]: Without dead ends: 2693 [2019-12-27 23:17:14,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=669, Invalid=1881, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 23:17:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2019-12-27 23:17:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 1999. [2019-12-27 23:17:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-12-27 23:17:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 4513 transitions. [2019-12-27 23:17:14,388 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 4513 transitions. Word has length 18 [2019-12-27 23:17:14,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:17:14,388 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 4513 transitions. [2019-12-27 23:17:14,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 23:17:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 4513 transitions. [2019-12-27 23:17:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:17:14,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:14,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:17:14,390 INFO L410 AbstractCegarLoop]: === Iteration 18 === [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]=== [2019-12-27 23:17:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2096832625, now seen corresponding path program 4 times [2019-12-27 23:17:14,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:14,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766142486] [2019-12-27 23:17:14,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:17:14,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766142486] [2019-12-27 23:17:14,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:17:14,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:17:14,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [655127777] [2019-12-27 23:17:14,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:14,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:14,711 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 56 transitions. [2019-12-27 23:17:14,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:14,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:14,722 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:14,725 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:14,751 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:14,766 INFO L614 ElimStorePlain]: treesize reduction 4, result has 91.5 percent of original size [2019-12-27 23:17:14,767 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 23:17:14,767 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:131, output treesize:43 [2019-12-27 23:17:14,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:15,545 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:17:15,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 23:17:15,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 23:17:15,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:17:15,546 INFO L87 Difference]: Start difference. First operand 1999 states and 4513 transitions. Second operand 29 states. [2019-12-27 23:17:16,000 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-12-27 23:17:17,859 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-27 23:17:18,521 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-12-27 23:17:19,155 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 77 [2019-12-27 23:17:19,737 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2019-12-27 23:17:19,968 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 79 [2019-12-27 23:17:20,215 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2019-12-27 23:17:20,731 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 76 [2019-12-27 23:17:21,356 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-12-27 23:17:21,915 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-12-27 23:17:28,588 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2019-12-27 23:17:29,420 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-12-27 23:17:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:17:31,270 INFO L93 Difference]: Finished difference Result 3020 states and 6595 transitions. [2019-12-27 23:17:31,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:17:31,270 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 18 [2019-12-27 23:17:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:17:31,273 INFO L225 Difference]: With dead ends: 3020 [2019-12-27 23:17:31,273 INFO L226 Difference]: Without dead ends: 3020 [2019-12-27 23:17:31,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=827, Invalid=3463, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 23:17:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2019-12-27 23:17:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 1991. [2019-12-27 23:17:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-27 23:17:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4495 transitions. [2019-12-27 23:17:31,306 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4495 transitions. Word has length 18 [2019-12-27 23:17:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:17:31,306 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4495 transitions. [2019-12-27 23:17:31,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 23:17:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4495 transitions. [2019-12-27 23:17:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:17:31,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:31,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:17:31,308 INFO L410 AbstractCegarLoop]: === Iteration 19 === [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]=== [2019-12-27 23:17:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:31,309 INFO L82 PathProgramCache]: Analyzing trace with hash 302222785, now seen corresponding path program 5 times [2019-12-27 23:17:31,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:31,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187952805] [2019-12-27 23:17:31,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:17:31,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187952805] [2019-12-27 23:17:31,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:17:31,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 23:17:31,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1935541982] [2019-12-27 23:17:31,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:31,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:31,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 58 transitions. [2019-12-27 23:17:31,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:31,663 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:31,665 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:31,667 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:31,670 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:31,688 INFO L614 ElimStorePlain]: treesize reduction 4, result has 91.5 percent of original size [2019-12-27 23:17:31,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 23:17:31,689 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:131, output treesize:43 [2019-12-27 23:17:31,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:32,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:17:32,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 23:17:32,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 23:17:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:17:32,436 INFO L87 Difference]: Start difference. First operand 1991 states and 4495 transitions. Second operand 29 states. [2019-12-27 23:17:33,112 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-12-27 23:17:35,041 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-27 23:17:35,657 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-12-27 23:17:36,279 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 77 [2019-12-27 23:17:36,823 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 79 [2019-12-27 23:17:37,012 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2019-12-27 23:17:37,228 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2019-12-27 23:17:37,705 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 75 [2019-12-27 23:17:38,272 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2019-12-27 23:17:38,774 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-12-27 23:17:44,978 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2019-12-27 23:17:45,804 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-12-27 23:17:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:17:47,690 INFO L93 Difference]: Finished difference Result 2940 states and 6417 transitions. [2019-12-27 23:17:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 23:17:47,690 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 18 [2019-12-27 23:17:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:17:47,695 INFO L225 Difference]: With dead ends: 2940 [2019-12-27 23:17:47,695 INFO L226 Difference]: Without dead ends: 2940 [2019-12-27 23:17:47,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=904, Invalid=3386, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 23:17:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2019-12-27 23:17:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1981. [2019-12-27 23:17:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2019-12-27 23:17:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 4473 transitions. [2019-12-27 23:17:47,719 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 4473 transitions. Word has length 18 [2019-12-27 23:17:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:17:47,719 INFO L462 AbstractCegarLoop]: Abstraction has 1981 states and 4473 transitions. [2019-12-27 23:17:47,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 23:17:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 4473 transitions. [2019-12-27 23:17:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:17:47,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:47,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:17:47,720 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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]=== [2019-12-27 23:17:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1783168668, now seen corresponding path program 1 times [2019-12-27 23:17:47,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:47,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294111145] [2019-12-27 23:17:47,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:17:48,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294111145] [2019-12-27 23:17:48,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:17:48,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 23:17:48,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739113873] [2019-12-27 23:17:48,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:48,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:48,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 18 transitions. [2019-12-27 23:17:48,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:48,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:17:48,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:17:48,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:17:48,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:17:48,037 INFO L87 Difference]: Start difference. First operand 1981 states and 4473 transitions. Second operand 15 states. [2019-12-27 23:17:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:17:50,873 INFO L93 Difference]: Finished difference Result 3215 states and 7202 transitions. [2019-12-27 23:17:50,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:17:50,874 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 23:17:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:17:50,879 INFO L225 Difference]: With dead ends: 3215 [2019-12-27 23:17:50,879 INFO L226 Difference]: Without dead ends: 3215 [2019-12-27 23:17:50,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:17:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2019-12-27 23:17:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 2023. [2019-12-27 23:17:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-12-27 23:17:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 4561 transitions. [2019-12-27 23:17:50,911 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 4561 transitions. Word has length 18 [2019-12-27 23:17:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:17:50,912 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 4561 transitions. [2019-12-27 23:17:50,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:17:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 4561 transitions. [2019-12-27 23:17:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:17:50,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:50,913 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:17:50,914 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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]=== [2019-12-27 23:17:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1098311042, now seen corresponding path program 1 times [2019-12-27 23:17:50,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:50,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880511245] [2019-12-27 23:17:50,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:17:51,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880511245] [2019-12-27 23:17:51,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002486733] [2019-12-27 23:17:51,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:17:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:51,555 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 85 conjunts are in the unsatisfiable core [2019-12-27 23:17:51,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:17:51,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:51,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:51,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:51,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 104 [2019-12-27 23:17:51,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:51,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:51,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:51,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:51,655 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:51,974 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-12-27 23:17:51,974 INFO L614 ElimStorePlain]: treesize reduction 79, result has 73.1 percent of original size [2019-12-27 23:17:51,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:51,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 38 [2019-12-27 23:17:52,002 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:52,065 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:52,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 38 [2019-12-27 23:17:52,076 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:52,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:52,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:17:52,133 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:232, output treesize:124 [2019-12-27 23:17:52,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,542 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:17:52,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 19 [2019-12-27 23:17:52,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:52,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:52,646 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:17:52,646 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:145, output treesize:90 [2019-12-27 23:17:52,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,848 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:17:52,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,851 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:17:52,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:52,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,031 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-27 23:17:53,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:53,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 114 treesize of output 330 [2019-12-27 23:17:53,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,127 INFO L614 ElimStorePlain]: treesize reduction 188, result has 26.6 percent of original size [2019-12-27 23:17:53,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:53,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:53,128 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,128 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:123, output treesize:74 [2019-12-27 23:17:53,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:53,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:53,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:53,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 80 treesize of output 60 [2019-12-27 23:17:53,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:53,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 52 [2019-12-27 23:17:53,289 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:17:53,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:53,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 67 [2019-12-27 23:17:53,308 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,426 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-27 23:17:53,427 INFO L614 ElimStorePlain]: treesize reduction 74, result has 62.4 percent of original size [2019-12-27 23:17:53,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 23:17:53,428 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:251, output treesize:101 [2019-12-27 23:17:53,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:17:53,647 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_24], 1=[|#memory_$Pointer$.base|]} [2019-12-27 23:17:53,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:53,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 22 [2019-12-27 23:17:53,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:53,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:53,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 30 [2019-12-27 23:17:53,678 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,689 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:53,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,690 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:4 [2019-12-27 23:17:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:17:53,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:17:53,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-12-27 23:17:53,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1523056600] [2019-12-27 23:17:53,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:53,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:53,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 79 transitions. [2019-12-27 23:17:53,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:53,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:53,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:17:53,924 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:64 [2019-12-27 23:17:54,033 INFO L430 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_349|], 14=[|v_#memory_$Pointer$.base_351|]} [2019-12-27 23:17:54,036 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:17:54,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:54,066 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:17:54,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:17:54,085 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 23:17:54,085 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:154 [2019-12-27 23:17:55,604 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-12-27 23:17:55,820 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:17:55,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 23:17:55,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:55,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 23:17:55,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:17:55,821 INFO L87 Difference]: Start difference. First operand 2023 states and 4561 transitions. Second operand 30 states. [2019-12-27 23:17:56,442 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-12-27 23:17:56,777 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2019-12-27 23:17:57,148 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 89 [2019-12-27 23:17:57,567 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 78 [2019-12-27 23:17:58,201 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 192 [2019-12-27 23:17:58,694 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 102 [2019-12-27 23:17:58,923 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 92 [2019-12-27 23:17:59,236 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-12-27 23:18:00,201 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 133 [2019-12-27 23:18:01,100 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 188 [2019-12-27 23:18:01,686 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 128 [2019-12-27 23:18:02,255 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 129 [2019-12-27 23:18:02,846 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 314 DAG size of output: 158 [2019-12-27 23:18:03,542 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 133 [2019-12-27 23:18:03,934 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 94 [2019-12-27 23:18:04,539 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 165 [2019-12-27 23:18:05,242 WARN L192 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 348 DAG size of output: 225 [2019-12-27 23:18:06,500 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-12-27 23:18:07,196 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 92 [2019-12-27 23:18:08,432 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 195 [2019-12-27 23:18:09,002 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 105 [2019-12-27 23:18:09,272 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 95 Received shutdown request... [2019-12-27 23:18:10,708 WARN L209 SmtUtils]: Removed 33 from assertion stack [2019-12-27 23:18:10,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:18:10,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:18:10,909 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 23:18:10,914 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 23:18:10,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:18:10 BasicIcfg [2019-12-27 23:18:10,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:18:10,916 INFO L168 Benchmark]: Toolchain (without parser) took 254472.32 ms. Allocated memory was 145.2 MB in the beginning and 357.0 MB in the end (delta: 211.8 MB). Free memory was 99.7 MB in the beginning and 158.7 MB in the end (delta: -59.0 MB). Peak memory consumption was 152.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:18:10,916 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 23:18:10,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 960.21 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 130.9 MB in the end (delta: -31.4 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:18:10,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.57 ms. Allocated memory is still 202.9 MB. Free memory was 130.9 MB in the beginning and 126.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:18:10,917 INFO L168 Benchmark]: Boogie Preprocessor took 90.73 ms. Allocated memory is still 202.9 MB. Free memory was 126.9 MB in the beginning and 122.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-12-27 23:18:10,918 INFO L168 Benchmark]: RCFGBuilder took 1122.41 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 122.8 MB in the beginning and 154.4 MB in the end (delta: -31.6 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:18:10,918 INFO L168 Benchmark]: TraceAbstraction took 252152.49 ms. Allocated memory was 235.9 MB in the beginning and 357.0 MB in the end (delta: 121.1 MB). Free memory was 154.4 MB in the beginning and 158.7 MB in the end (delta: -4.4 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:18:10,925 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 960.21 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 130.9 MB in the end (delta: -31.4 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 141.57 ms. Allocated memory is still 202.9 MB. Free memory was 130.9 MB in the beginning and 126.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.73 ms. Allocated memory is still 202.9 MB. Free memory was 126.9 MB in the beginning and 122.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1122.41 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 122.8 MB in the beginning and 154.4 MB in the end (delta: -31.6 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252152.49 ms. Allocated memory was 235.9 MB in the beginning and 357.0 MB in the end (delta: 121.1 MB). Free memory was 154.4 MB in the beginning and 158.7 MB in the end (delta: -4.4 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 21.7s, 415 ProgramPointsBefore, 106 ProgramPointsAfterwards, 443 TransitionsBefore, 124 TransitionsAfterwards, 30326 CoEnabledTransitionPairs, 9 FixpointIterations, 121 TrivialSequentialCompositions, 213 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 66 ConcurrentYvCompositions, 11 ChoiceCompositions, 15859 VarBasedMoverChecksPositive, 227 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 79514 CheckedPairsTotal, 428 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1064). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1087]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1085]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (2023states) and FLOYD_HOARE automaton (currently 43 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 299 for 84ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 412 locations, 11 error locations. Result: TIMEOUT, OverallTime: 251.9s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 211.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2456 SDtfs, 15497 SDslu, 11627 SDs, 0 SdLazy, 82095 SolverSat, 1557 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 105.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 944 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 899 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17370 ImplicationChecksByTransitivity, 103.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2023occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 16857 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 127507 SizeOfPredicates, 39 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown