/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-17 22:47:47,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-17 22:47:47,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-17 22:47:47,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-17 22:47:47,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-17 22:47:47,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-17 22:47:47,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-17 22:47:47,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-17 22:47:47,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-17 22:47:47,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-17 22:47:47,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-17 22:47:47,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-17 22:47:47,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-17 22:47:47,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-17 22:47:47,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-17 22:47:47,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-17 22:47:47,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-17 22:47:47,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-17 22:47:47,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-17 22:47:47,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-17 22:47:47,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-17 22:47:47,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-17 22:47:47,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-17 22:47:47,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-17 22:47:47,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-17 22:47:47,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-17 22:47:47,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-17 22:47:47,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-17 22:47:47,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-17 22:47:47,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-17 22:47:47,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-17 22:47:47,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-17 22:47:47,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-17 22:47:47,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-17 22:47:47,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-17 22:47:47,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-17 22:47:47,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-17 22:47:47,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-17 22:47:47,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-17 22:47:47,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-17 22:47:47,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-17 22:47:47,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-04-17 22:47:47,468 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-17 22:47:47,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-17 22:47:47,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-17 22:47:47,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-17 22:47:47,470 INFO L138 SettingsManager]: * Use SBE=true [2020-04-17 22:47:47,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-17 22:47:47,471 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-17 22:47:47,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-17 22:47:47,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-17 22:47:47,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-17 22:47:47,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-17 22:47:47,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-17 22:47:47,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-17 22:47:47,472 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-17 22:47:47,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-17 22:47:47,472 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-17 22:47:47,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-17 22:47:47,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-17 22:47:47,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-17 22:47:47,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-17 22:47:47,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-17 22:47:47,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-17 22:47:47,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-17 22:47:47,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-17 22:47:47,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-17 22:47:47,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-04-17 22:47:47,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-17 22:47:47,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-17 22:47:47,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-17 22:47:47,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-17 22:47:47,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-17 22:47:47,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-17 22:47:47,792 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-17 22:47:47,792 INFO L275 PluginConnector]: CDTParser initialized [2020-04-17 22:47:47,793 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2020-04-17 22:47:47,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76376b308/451d74b2552e403588f42af26a31ed54/FLAG4e4b9c7e9 [2020-04-17 22:47:48,393 INFO L306 CDTParser]: Found 1 translation units. [2020-04-17 22:47:48,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2020-04-17 22:47:48,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76376b308/451d74b2552e403588f42af26a31ed54/FLAG4e4b9c7e9 [2020-04-17 22:47:48,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76376b308/451d74b2552e403588f42af26a31ed54 [2020-04-17 22:47:48,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-17 22:47:48,725 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-17 22:47:48,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-17 22:47:48,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-17 22:47:48,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-17 22:47:48,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 10:47:48" (1/1) ... [2020-04-17 22:47:48,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4eaff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:48, skipping insertion in model container [2020-04-17 22:47:48,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 10:47:48" (1/1) ... [2020-04-17 22:47:48,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-17 22:47:48,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-17 22:47:49,010 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 22:47:49,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 22:47:49,484 INFO L203 MainTranslator]: Completed pre-run [2020-04-17 22:47:49,505 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 22:47:49,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 22:47:49,718 INFO L208 MainTranslator]: Completed translation [2020-04-17 22:47:49,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49 WrapperNode [2020-04-17 22:47:49,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-17 22:47:49,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-17 22:47:49,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-17 22:47:49,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-17 22:47:49,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... [2020-04-17 22:47:49,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... [2020-04-17 22:47:49,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-17 22:47:49,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-17 22:47:49,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-17 22:47:49,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-17 22:47:49,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... [2020-04-17 22:47:49,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... [2020-04-17 22:47:49,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... [2020-04-17 22:47:49,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... [2020-04-17 22:47:49,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... [2020-04-17 22:47:49,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... [2020-04-17 22:47:49,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... [2020-04-17 22:47:49,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-17 22:47:49,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-17 22:47:49,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-17 22:47:49,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-17 22:47:49,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-17 22:47:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2020-04-17 22:47:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2020-04-17 22:47:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-17 22:47:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-04-17 22:47:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-17 22:47:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-17 22:47:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-17 22:47:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-04-17 22:47:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-04-17 22:47:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-17 22:47:50,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-17 22:47:50,012 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-17 22:47:51,071 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-17 22:47:51,071 INFO L295 CfgBuilder]: Removed 40 assume(true) statements. [2020-04-17 22:47:51,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 10:47:51 BoogieIcfgContainer [2020-04-17 22:47:51,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-17 22:47:51,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-17 22:47:51,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-17 22:47:51,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-17 22:47:51,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.04 10:47:48" (1/3) ... [2020-04-17 22:47:51,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1a15e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 10:47:51, skipping insertion in model container [2020-04-17 22:47:51,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:49" (2/3) ... [2020-04-17 22:47:51,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1a15e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 10:47:51, skipping insertion in model container [2020-04-17 22:47:51,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 10:47:51" (3/3) ... [2020-04-17 22:47:51,087 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2020-04-17 22:47:51,099 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-17 22:47:51,099 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-17 22:47:51,108 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-04-17 22:47:51,109 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-17 22:47:51,184 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,185 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,185 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,185 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,186 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,186 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,186 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,186 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,186 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,187 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,188 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,188 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,188 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,188 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,189 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,189 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,189 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,189 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,189 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,190 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,190 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,190 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,190 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,190 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,190 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,191 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,191 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,191 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,191 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,192 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,194 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,194 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,195 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,195 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,195 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,195 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,195 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,196 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,196 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,196 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,196 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,197 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,197 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,197 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,197 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,197 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,198 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,198 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,198 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,198 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,198 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,198 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,199 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,199 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,199 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,199 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,199 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,200 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,200 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,200 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,201 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,201 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,201 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,201 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,203 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,203 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,204 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,204 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,204 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,204 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,205 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,205 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,205 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,206 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,206 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,206 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,207 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,207 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,207 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,207 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,208 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,209 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,209 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,209 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,209 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,209 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,210 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,210 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,210 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,210 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,211 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,211 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,211 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,211 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,211 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,212 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,213 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,216 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,218 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,218 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,218 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,227 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,228 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,228 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,228 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,228 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,229 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,229 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,229 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,229 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,229 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,230 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,230 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,231 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,232 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,232 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,232 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,233 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,233 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,233 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,233 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,233 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,234 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,234 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,234 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,234 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,234 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,235 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,235 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,236 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,236 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,236 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,236 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,236 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,236 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,237 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,237 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,237 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,237 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,237 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,237 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,238 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,238 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,238 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,238 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,238 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,238 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,239 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,239 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,239 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,240 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,240 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,240 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,240 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,240 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,240 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,241 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,241 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,241 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,241 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,241 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,241 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,242 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,242 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,242 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,242 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,242 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,242 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,243 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,243 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,243 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,243 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,243 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,244 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,244 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,244 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,244 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,244 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,244 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,245 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,245 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,245 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,245 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,245 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,252 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,252 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,252 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,252 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,253 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,253 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,253 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,253 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,253 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,254 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,254 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,254 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,254 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,254 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,254 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,255 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,255 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,255 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,255 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,255 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,255 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,256 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,256 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,256 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,256 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,257 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,257 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,257 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,257 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,261 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,262 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,262 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,262 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,262 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,263 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,263 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,263 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,263 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,263 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,264 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,268 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,268 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,268 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,269 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:51,290 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-04-17 22:47:51,310 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-17 22:47:51,311 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-17 22:47:51,311 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-17 22:47:51,311 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-17 22:47:51,311 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-17 22:47:51,311 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-17 22:47:51,311 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-17 22:47:51,311 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-17 22:47:51,340 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 426 places, 455 transitions, 918 flow [2020-04-17 22:47:51,342 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions, 918 flow [2020-04-17 22:47:51,513 INFO L129 PetriNetUnfolder]: 33/454 cut-off events. [2020-04-17 22:47:51,513 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-04-17 22:47:51,561 INFO L80 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2020-04-17 22:47:51,590 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions, 918 flow [2020-04-17 22:47:51,702 INFO L129 PetriNetUnfolder]: 33/454 cut-off events. [2020-04-17 22:47:51,703 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-04-17 22:47:51,711 INFO L80 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2020-04-17 22:47:51,747 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31742 [2020-04-17 22:47:51,748 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-17 22:47:53,589 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:53,609 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:47:53,611 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:53,611 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2020-04-17 22:47:53,969 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:53,994 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:47:53,996 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:53,996 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2020-04-17 22:47:55,716 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:55,751 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:47:55,752 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:55,753 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-04-17 22:47:55,766 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:55,790 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:47:55,791 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:55,792 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2020-04-17 22:47:58,495 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:58,521 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:47:58,522 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:58,523 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2020-04-17 22:47:58,550 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:58,580 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:47:58,581 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:58,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-04-17 22:48:01,100 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:01,113 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:01,114 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:01,114 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2020-04-17 22:48:01,456 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:01,481 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:01,481 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:01,482 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2020-04-17 22:48:01,523 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:01,549 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:01,550 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:01,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-04-17 22:48:03,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:03,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:04,193 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:04,221 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:04,222 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:04,222 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:112 [2020-04-17 22:48:04,232 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:04,259 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:04,260 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:04,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2020-04-17 22:48:06,332 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:06,365 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:06,366 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:06,366 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-04-17 22:48:06,378 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:06,404 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:06,405 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:06,405 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2020-04-17 22:48:08,503 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:08,539 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:08,540 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:08,540 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2020-04-17 22:48:08,551 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:08,581 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:08,582 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:08,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:112 [2020-04-17 22:48:10,813 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:10,840 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:10,841 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:10,842 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-04-17 22:48:10,853 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:10,880 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:10,880 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:10,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2020-04-17 22:48:13,088 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:13,123 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:13,124 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:13,124 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2020-04-17 22:48:13,136 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:13,172 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:13,172 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:13,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-04-17 22:48:15,504 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:15,533 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:15,533 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:15,534 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-04-17 22:48:15,544 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:15,571 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:15,572 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:15,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-04-17 22:48:17,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:17,942 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:17,971 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:17,971 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:17,972 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-04-17 22:48:17,983 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:18,014 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:18,015 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:18,015 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-04-17 22:48:20,150 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:20,218 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:20,220 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:20,220 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:172, output treesize:181 [2020-04-17 22:48:20,546 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:20,568 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:20,569 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:20,570 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-04-17 22:48:20,584 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:20,614 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:20,615 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:20,615 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:105 [2020-04-17 22:48:22,930 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:22,963 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:22,965 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:22,965 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-04-17 22:48:22,976 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:22,997 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:22,998 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:22,999 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-04-17 22:48:25,043 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:25,066 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:25,067 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:25,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-04-17 22:48:25,077 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:25,102 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:25,103 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:25,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-04-17 22:48:27,705 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:27,730 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:27,730 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:27,731 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-04-17 22:48:27,740 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:27,761 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:27,762 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:27,762 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-04-17 22:48:30,138 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:30,167 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:30,167 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:30,168 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-04-17 22:48:30,186 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:30,236 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:30,237 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:30,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-04-17 22:48:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:33,196 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-04-17 22:48:33,374 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-04-17 22:48:33,492 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:33,523 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:33,524 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:33,524 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:105 [2020-04-17 22:48:33,533 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:33,557 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:33,558 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:33,558 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-04-17 22:48:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:36,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:37,236 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-04-17 22:48:37,557 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2020-04-17 22:48:38,105 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-04-17 22:48:38,401 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-04-17 22:48:38,842 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-04-17 22:48:39,012 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-04-17 22:48:39,585 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-04-17 22:48:40,027 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-04-17 22:48:41,855 WARN L192 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 178 DAG size of output: 163 [2020-04-17 22:48:41,883 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:43,137 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 139 [2020-04-17 22:48:43,137 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:43,138 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:43,138 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2020-04-17 22:48:44,330 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 139 [2020-04-17 22:48:44,935 INFO L206 etLargeBlockEncoding]: Checked pairs total: 121870 [2020-04-17 22:48:44,936 INFO L214 etLargeBlockEncoding]: Total number of compositions: 437 [2020-04-17 22:48:44,939 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 121 transitions, 250 flow [2020-04-17 22:48:44,997 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1471 states. [2020-04-17 22:48:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states. [2020-04-17 22:48:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-17 22:48:45,008 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:45,008 INFO L425 BasicCegarLoop]: trace histogram [1] [2020-04-17 22:48:45,012 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1596, now seen corresponding path program 1 times [2020-04-17 22:48:45,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:45,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500326504] [2020-04-17 22:48:45,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:45,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500326504] [2020-04-17 22:48:45,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:45,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-04-17 22:48:45,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437922013] [2020-04-17 22:48:45,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-17 22:48:45,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-17 22:48:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-17 22:48:45,177 INFO L87 Difference]: Start difference. First operand 1471 states. Second operand 2 states. [2020-04-17 22:48:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:45,246 INFO L93 Difference]: Finished difference Result 1470 states and 3297 transitions. [2020-04-17 22:48:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-17 22:48:45,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-04-17 22:48:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:45,280 INFO L225 Difference]: With dead ends: 1470 [2020-04-17 22:48:45,280 INFO L226 Difference]: Without dead ends: 1469 [2020-04-17 22:48:45,285 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-17 22:48:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-04-17 22:48:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2020-04-17 22:48:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2020-04-17 22:48:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3296 transitions. [2020-04-17 22:48:45,416 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3296 transitions. Word has length 1 [2020-04-17 22:48:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:45,416 INFO L479 AbstractCegarLoop]: Abstraction has 1469 states and 3296 transitions. [2020-04-17 22:48:45,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-17 22:48:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3296 transitions. [2020-04-17 22:48:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-04-17 22:48:45,417 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:45,417 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-04-17 22:48:45,418 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:45,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:45,418 INFO L82 PathProgramCache]: Analyzing trace with hash -508671505, now seen corresponding path program 1 times [2020-04-17 22:48:45,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:45,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993295242] [2020-04-17 22:48:45,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:45,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993295242] [2020-04-17 22:48:45,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:45,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-17 22:48:45,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408581304] [2020-04-17 22:48:45,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-17 22:48:45,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:45,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-17 22:48:45,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-17 22:48:45,543 INFO L87 Difference]: Start difference. First operand 1469 states and 3296 transitions. Second operand 3 states. [2020-04-17 22:48:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:45,607 INFO L93 Difference]: Finished difference Result 2761 states and 6206 transitions. [2020-04-17 22:48:45,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-17 22:48:45,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-04-17 22:48:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:45,625 INFO L225 Difference]: With dead ends: 2761 [2020-04-17 22:48:45,626 INFO L226 Difference]: Without dead ends: 2761 [2020-04-17 22:48:45,626 INFO L678 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 [2020-04-17 22:48:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2020-04-17 22:48:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 1488. [2020-04-17 22:48:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2020-04-17 22:48:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3336 transitions. [2020-04-17 22:48:45,685 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3336 transitions. Word has length 6 [2020-04-17 22:48:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:45,686 INFO L479 AbstractCegarLoop]: Abstraction has 1488 states and 3336 transitions. [2020-04-17 22:48:45,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-17 22:48:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3336 transitions. [2020-04-17 22:48:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-17 22:48:45,687 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:45,687 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:45,687 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:45,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:45,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1410435842, now seen corresponding path program 1 times [2020-04-17 22:48:45,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:45,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009853483] [2020-04-17 22:48:45,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:45,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009853483] [2020-04-17 22:48:45,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:45,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-17 22:48:45,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663424347] [2020-04-17 22:48:45,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-17 22:48:45,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-17 22:48:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-17 22:48:45,762 INFO L87 Difference]: Start difference. First operand 1488 states and 3336 transitions. Second operand 3 states. [2020-04-17 22:48:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:45,780 INFO L93 Difference]: Finished difference Result 1488 states and 3317 transitions. [2020-04-17 22:48:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-17 22:48:45,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-04-17 22:48:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:45,789 INFO L225 Difference]: With dead ends: 1488 [2020-04-17 22:48:45,789 INFO L226 Difference]: Without dead ends: 1488 [2020-04-17 22:48:45,790 INFO L678 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 [2020-04-17 22:48:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2020-04-17 22:48:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2020-04-17 22:48:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2020-04-17 22:48:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3317 transitions. [2020-04-17 22:48:45,916 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3317 transitions. Word has length 7 [2020-04-17 22:48:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:45,917 INFO L479 AbstractCegarLoop]: Abstraction has 1488 states and 3317 transitions. [2020-04-17 22:48:45,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-17 22:48:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3317 transitions. [2020-04-17 22:48:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-17 22:48:45,918 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:45,918 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:45,918 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:45,919 INFO L82 PathProgramCache]: Analyzing trace with hash 785906965, now seen corresponding path program 1 times [2020-04-17 22:48:45,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:45,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677237929] [2020-04-17 22:48:45,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:46,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677237929] [2020-04-17 22:48:46,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:46,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-17 22:48:46,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629016303] [2020-04-17 22:48:46,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-17 22:48:46,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-17 22:48:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-17 22:48:46,037 INFO L87 Difference]: Start difference. First operand 1488 states and 3317 transitions. Second operand 6 states. [2020-04-17 22:48:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:46,664 INFO L93 Difference]: Finished difference Result 1874 states and 4178 transitions. [2020-04-17 22:48:46,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-17 22:48:46,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-04-17 22:48:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:46,677 INFO L225 Difference]: With dead ends: 1874 [2020-04-17 22:48:46,677 INFO L226 Difference]: Without dead ends: 1874 [2020-04-17 22:48:46,678 INFO L678 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 [2020-04-17 22:48:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2020-04-17 22:48:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1595. [2020-04-17 22:48:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2020-04-17 22:48:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3562 transitions. [2020-04-17 22:48:46,742 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3562 transitions. Word has length 8 [2020-04-17 22:48:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:46,742 INFO L479 AbstractCegarLoop]: Abstraction has 1595 states and 3562 transitions. [2020-04-17 22:48:46,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-17 22:48:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3562 transitions. [2020-04-17 22:48:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-17 22:48:46,746 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:46,747 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:46,747 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:46,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash -657309392, now seen corresponding path program 1 times [2020-04-17 22:48:46,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:46,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110884331] [2020-04-17 22:48:46,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:46,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110884331] [2020-04-17 22:48:46,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:46,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-17 22:48:46,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584290671] [2020-04-17 22:48:46,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-17 22:48:46,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:46,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-17 22:48:46,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-17 22:48:46,843 INFO L87 Difference]: Start difference. First operand 1595 states and 3562 transitions. Second operand 3 states. [2020-04-17 22:48:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:46,926 INFO L93 Difference]: Finished difference Result 2622 states and 5848 transitions. [2020-04-17 22:48:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-17 22:48:46,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-04-17 22:48:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:46,943 INFO L225 Difference]: With dead ends: 2622 [2020-04-17 22:48:46,943 INFO L226 Difference]: Without dead ends: 2622 [2020-04-17 22:48:46,943 INFO L678 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 [2020-04-17 22:48:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2020-04-17 22:48:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 1652. [2020-04-17 22:48:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2020-04-17 22:48:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3682 transitions. [2020-04-17 22:48:47,003 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3682 transitions. Word has length 10 [2020-04-17 22:48:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:47,004 INFO L479 AbstractCegarLoop]: Abstraction has 1652 states and 3682 transitions. [2020-04-17 22:48:47,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-17 22:48:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3682 transitions. [2020-04-17 22:48:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-17 22:48:47,011 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:47,011 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:47,011 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:47,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:47,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1466837113, now seen corresponding path program 1 times [2020-04-17 22:48:47,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:47,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371602583] [2020-04-17 22:48:47,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:47,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371602583] [2020-04-17 22:48:47,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:47,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-17 22:48:47,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848683140] [2020-04-17 22:48:47,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-17 22:48:47,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:47,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-17 22:48:47,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-04-17 22:48:47,215 INFO L87 Difference]: Start difference. First operand 1652 states and 3682 transitions. Second operand 11 states. [2020-04-17 22:48:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:49,458 INFO L93 Difference]: Finished difference Result 2046 states and 4542 transitions. [2020-04-17 22:48:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:48:49,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-04-17 22:48:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:49,472 INFO L225 Difference]: With dead ends: 2046 [2020-04-17 22:48:49,472 INFO L226 Difference]: Without dead ends: 2046 [2020-04-17 22:48:49,473 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2020-04-17 22:48:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2020-04-17 22:48:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1661. [2020-04-17 22:48:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2020-04-17 22:48:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3702 transitions. [2020-04-17 22:48:49,520 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3702 transitions. Word has length 14 [2020-04-17 22:48:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:49,520 INFO L479 AbstractCegarLoop]: Abstraction has 1661 states and 3702 transitions. [2020-04-17 22:48:49,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-17 22:48:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3702 transitions. [2020-04-17 22:48:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-17 22:48:49,522 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:49,522 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:49,523 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:49,523 INFO L82 PathProgramCache]: Analyzing trace with hash 340772533, now seen corresponding path program 2 times [2020-04-17 22:48:49,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:49,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456401681] [2020-04-17 22:48:49,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:49,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456401681] [2020-04-17 22:48:49,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:49,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-17 22:48:49,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141084859] [2020-04-17 22:48:49,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-17 22:48:49,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:49,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-17 22:48:49,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-04-17 22:48:49,688 INFO L87 Difference]: Start difference. First operand 1661 states and 3702 transitions. Second operand 11 states. [2020-04-17 22:48:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:51,942 INFO L93 Difference]: Finished difference Result 2017 states and 4481 transitions. [2020-04-17 22:48:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-17 22:48:51,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-04-17 22:48:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:51,955 INFO L225 Difference]: With dead ends: 2017 [2020-04-17 22:48:51,955 INFO L226 Difference]: Without dead ends: 2017 [2020-04-17 22:48:51,956 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=491, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:48:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2020-04-17 22:48:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1661. [2020-04-17 22:48:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2020-04-17 22:48:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3702 transitions. [2020-04-17 22:48:52,000 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3702 transitions. Word has length 14 [2020-04-17 22:48:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:52,000 INFO L479 AbstractCegarLoop]: Abstraction has 1661 states and 3702 transitions. [2020-04-17 22:48:52,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-17 22:48:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3702 transitions. [2020-04-17 22:48:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-17 22:48:52,001 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:52,002 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:52,002 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1689662637, now seen corresponding path program 1 times [2020-04-17 22:48:52,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:52,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796271233] [2020-04-17 22:48:52,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:52,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796271233] [2020-04-17 22:48:52,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:52,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-17 22:48:52,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865157495] [2020-04-17 22:48:52,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-17 22:48:52,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:52,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-17 22:48:52,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-17 22:48:52,163 INFO L87 Difference]: Start difference. First operand 1661 states and 3702 transitions. Second operand 8 states. [2020-04-17 22:48:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:53,380 INFO L93 Difference]: Finished difference Result 2488 states and 5511 transitions. [2020-04-17 22:48:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-04-17 22:48:53,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-04-17 22:48:53,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:53,441 INFO L225 Difference]: With dead ends: 2488 [2020-04-17 22:48:53,441 INFO L226 Difference]: Without dead ends: 2402 [2020-04-17 22:48:53,441 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:48:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2020-04-17 22:48:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1819. [2020-04-17 22:48:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2020-04-17 22:48:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 4102 transitions. [2020-04-17 22:48:53,485 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 4102 transitions. Word has length 14 [2020-04-17 22:48:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:53,486 INFO L479 AbstractCegarLoop]: Abstraction has 1819 states and 4102 transitions. [2020-04-17 22:48:53,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-17 22:48:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 4102 transitions. [2020-04-17 22:48:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:53,487 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:53,487 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:53,487 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -163216421, now seen corresponding path program 1 times [2020-04-17 22:48:53,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:53,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746083254] [2020-04-17 22:48:53,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:54,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746083254] [2020-04-17 22:48:54,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:54,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:48:54,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994778699] [2020-04-17 22:48:54,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:48:54,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:54,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:48:54,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:48:54,039 INFO L87 Difference]: Start difference. First operand 1819 states and 4102 transitions. Second operand 13 states. [2020-04-17 22:48:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:57,887 INFO L93 Difference]: Finished difference Result 2601 states and 5817 transitions. [2020-04-17 22:48:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-17 22:48:57,887 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:48:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:57,901 INFO L225 Difference]: With dead ends: 2601 [2020-04-17 22:48:57,901 INFO L226 Difference]: Without dead ends: 2601 [2020-04-17 22:48:57,901 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2020-04-17 22:48:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2020-04-17 22:48:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1906. [2020-04-17 22:48:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2020-04-17 22:48:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 4300 transitions. [2020-04-17 22:48:57,949 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 4300 transitions. Word has length 15 [2020-04-17 22:48:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:57,950 INFO L479 AbstractCegarLoop]: Abstraction has 1906 states and 4300 transitions. [2020-04-17 22:48:57,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:48:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 4300 transitions. [2020-04-17 22:48:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:57,951 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:57,951 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:57,951 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:57,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1426686777, now seen corresponding path program 2 times [2020-04-17 22:48:57,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:57,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690655400] [2020-04-17 22:48:57,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:58,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690655400] [2020-04-17 22:48:58,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:58,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:48:58,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395590089] [2020-04-17 22:48:58,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:48:58,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:58,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:48:58,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:48:58,266 INFO L87 Difference]: Start difference. First operand 1906 states and 4300 transitions. Second operand 13 states. [2020-04-17 22:49:00,972 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2020-04-17 22:49:01,510 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 51 [2020-04-17 22:49:02,072 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2020-04-17 22:49:03,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:03,793 INFO L93 Difference]: Finished difference Result 2622 states and 5864 transitions. [2020-04-17 22:49:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-04-17 22:49:03,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:49:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:03,808 INFO L225 Difference]: With dead ends: 2622 [2020-04-17 22:49:03,808 INFO L226 Difference]: Without dead ends: 2622 [2020-04-17 22:49:03,809 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=501, Invalid=1221, Unknown=0, NotChecked=0, Total=1722 [2020-04-17 22:49:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2020-04-17 22:49:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 1922. [2020-04-17 22:49:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2020-04-17 22:49:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 4336 transitions. [2020-04-17 22:49:03,856 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 4336 transitions. Word has length 15 [2020-04-17 22:49:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:03,856 INFO L479 AbstractCegarLoop]: Abstraction has 1922 states and 4336 transitions. [2020-04-17 22:49:03,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 4336 transitions. [2020-04-17 22:49:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:03,857 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:03,858 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:03,858 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:03,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1507913705, now seen corresponding path program 3 times [2020-04-17 22:49:03,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:03,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648279156] [2020-04-17 22:49:03,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:04,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648279156] [2020-04-17 22:49:04,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:04,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:49:04,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385348033] [2020-04-17 22:49:04,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:04,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:04,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:04,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:04,185 INFO L87 Difference]: Start difference. First operand 1922 states and 4336 transitions. Second operand 13 states. [2020-04-17 22:49:06,784 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2020-04-17 22:49:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:09,689 INFO L93 Difference]: Finished difference Result 2450 states and 5483 transitions. [2020-04-17 22:49:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-04-17 22:49:09,689 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:49:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:09,695 INFO L225 Difference]: With dead ends: 2450 [2020-04-17 22:49:09,695 INFO L226 Difference]: Without dead ends: 2450 [2020-04-17 22:49:09,696 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=431, Invalid=1129, Unknown=0, NotChecked=0, Total=1560 [2020-04-17 22:49:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-04-17 22:49:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 1915. [2020-04-17 22:49:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2020-04-17 22:49:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 4321 transitions. [2020-04-17 22:49:09,738 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 4321 transitions. Word has length 15 [2020-04-17 22:49:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:09,738 INFO L479 AbstractCegarLoop]: Abstraction has 1915 states and 4321 transitions. [2020-04-17 22:49:09,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 4321 transitions. [2020-04-17 22:49:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:09,739 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:09,740 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:09,740 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:09,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash 654985635, now seen corresponding path program 4 times [2020-04-17 22:49:09,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:09,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593585453] [2020-04-17 22:49:09,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:10,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593585453] [2020-04-17 22:49:10,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:10,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:49:10,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688878054] [2020-04-17 22:49:10,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:10,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:10,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:10,074 INFO L87 Difference]: Start difference. First operand 1915 states and 4321 transitions. Second operand 13 states. [2020-04-17 22:49:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:15,408 INFO L93 Difference]: Finished difference Result 2404 states and 5385 transitions. [2020-04-17 22:49:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-17 22:49:15,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:49:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:15,416 INFO L225 Difference]: With dead ends: 2404 [2020-04-17 22:49:15,416 INFO L226 Difference]: Without dead ends: 2404 [2020-04-17 22:49:15,417 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=443, Invalid=1197, Unknown=0, NotChecked=0, Total=1640 [2020-04-17 22:49:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2020-04-17 22:49:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1906. [2020-04-17 22:49:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2020-04-17 22:49:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 4300 transitions. [2020-04-17 22:49:15,459 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 4300 transitions. Word has length 15 [2020-04-17 22:49:15,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:15,460 INFO L479 AbstractCegarLoop]: Abstraction has 1906 states and 4300 transitions. [2020-04-17 22:49:15,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 4300 transitions. [2020-04-17 22:49:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:15,461 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:15,461 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:15,462 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash 877819967, now seen corresponding path program 5 times [2020-04-17 22:49:15,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:15,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469637840] [2020-04-17 22:49:15,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:15,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469637840] [2020-04-17 22:49:15,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:15,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:49:15,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496346143] [2020-04-17 22:49:15,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:15,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:15,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:15,863 INFO L87 Difference]: Start difference. First operand 1906 states and 4300 transitions. Second operand 13 states. [2020-04-17 22:49:16,634 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 41 [2020-04-17 22:49:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:19,975 INFO L93 Difference]: Finished difference Result 2436 states and 5454 transitions. [2020-04-17 22:49:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-04-17 22:49:19,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:49:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:19,983 INFO L225 Difference]: With dead ends: 2436 [2020-04-17 22:49:19,983 INFO L226 Difference]: Without dead ends: 2436 [2020-04-17 22:49:19,984 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2020-04-17 22:49:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2020-04-17 22:49:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1910. [2020-04-17 22:49:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2020-04-17 22:49:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 4308 transitions. [2020-04-17 22:49:20,024 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 4308 transitions. Word has length 15 [2020-04-17 22:49:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:20,024 INFO L479 AbstractCegarLoop]: Abstraction has 1910 states and 4308 transitions. [2020-04-17 22:49:20,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 4308 transitions. [2020-04-17 22:49:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:20,026 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:20,026 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:20,026 INFO L427 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]=== [2020-04-17 22:49:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash 721619343, now seen corresponding path program 1 times [2020-04-17 22:49:20,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:20,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631173538] [2020-04-17 22:49:20,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:20,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631173538] [2020-04-17 22:49:20,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:20,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-17 22:49:20,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691089935] [2020-04-17 22:49:20,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 22:49:20,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:20,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 22:49:20,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-04-17 22:49:20,166 INFO L87 Difference]: Start difference. First operand 1910 states and 4308 transitions. Second operand 12 states. [2020-04-17 22:49:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:22,359 INFO L93 Difference]: Finished difference Result 2604 states and 5813 transitions. [2020-04-17 22:49:22,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:49:22,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-04-17 22:49:22,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:22,365 INFO L225 Difference]: With dead ends: 2604 [2020-04-17 22:49:22,365 INFO L226 Difference]: Without dead ends: 2604 [2020-04-17 22:49:22,366 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:49:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2020-04-17 22:49:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1938. [2020-04-17 22:49:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2020-04-17 22:49:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 4370 transitions. [2020-04-17 22:49:22,410 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 4370 transitions. Word has length 15 [2020-04-17 22:49:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:22,410 INFO L479 AbstractCegarLoop]: Abstraction has 1938 states and 4370 transitions. [2020-04-17 22:49:22,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 22:49:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 4370 transitions. [2020-04-17 22:49:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:22,412 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:22,412 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:22,412 INFO L427 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]=== [2020-04-17 22:49:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:22,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2117361739, now seen corresponding path program 2 times [2020-04-17 22:49:22,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:22,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005998401] [2020-04-17 22:49:22,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:22,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005998401] [2020-04-17 22:49:22,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:22,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-17 22:49:22,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629067926] [2020-04-17 22:49:22,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 22:49:22,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:22,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 22:49:22,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-04-17 22:49:22,579 INFO L87 Difference]: Start difference. First operand 1938 states and 4370 transitions. Second operand 12 states. [2020-04-17 22:49:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:25,037 INFO L93 Difference]: Finished difference Result 2618 states and 5845 transitions. [2020-04-17 22:49:25,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:49:25,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-04-17 22:49:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:25,042 INFO L225 Difference]: With dead ends: 2618 [2020-04-17 22:49:25,042 INFO L226 Difference]: Without dead ends: 2618 [2020-04-17 22:49:25,043 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:49:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2020-04-17 22:49:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1949. [2020-04-17 22:49:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2020-04-17 22:49:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 4396 transitions. [2020-04-17 22:49:25,085 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 4396 transitions. Word has length 15 [2020-04-17 22:49:25,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:25,086 INFO L479 AbstractCegarLoop]: Abstraction has 1949 states and 4396 transitions. [2020-04-17 22:49:25,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 22:49:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 4396 transitions. [2020-04-17 22:49:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:25,087 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:25,087 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:25,088 INFO L427 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]=== [2020-04-17 22:49:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1569098127, now seen corresponding path program 3 times [2020-04-17 22:49:25,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:25,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055115528] [2020-04-17 22:49:25,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:25,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055115528] [2020-04-17 22:49:25,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:25,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-17 22:49:25,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154294332] [2020-04-17 22:49:25,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 22:49:25,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:25,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 22:49:25,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-04-17 22:49:25,244 INFO L87 Difference]: Start difference. First operand 1949 states and 4396 transitions. Second operand 12 states. [2020-04-17 22:49:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:28,504 INFO L93 Difference]: Finished difference Result 2693 states and 6011 transitions. [2020-04-17 22:49:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-17 22:49:28,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-04-17 22:49:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:28,509 INFO L225 Difference]: With dead ends: 2693 [2020-04-17 22:49:28,509 INFO L226 Difference]: Without dead ends: 2693 [2020-04-17 22:49:28,510 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=289, Invalid=641, Unknown=0, NotChecked=0, Total=930 [2020-04-17 22:49:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2020-04-17 22:49:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 1959. [2020-04-17 22:49:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2020-04-17 22:49:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 4420 transitions. [2020-04-17 22:49:28,550 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 4420 transitions. Word has length 15 [2020-04-17 22:49:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:28,550 INFO L479 AbstractCegarLoop]: Abstraction has 1959 states and 4420 transitions. [2020-04-17 22:49:28,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 22:49:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 4420 transitions. [2020-04-17 22:49:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:28,552 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:28,552 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:28,552 INFO L427 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]=== [2020-04-17 22:49:28,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:28,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2009728693, now seen corresponding path program 4 times [2020-04-17 22:49:28,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:28,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100010769] [2020-04-17 22:49:28,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:28,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100010769] [2020-04-17 22:49:28,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:28,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-17 22:49:28,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331148254] [2020-04-17 22:49:28,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 22:49:28,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:28,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 22:49:28,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-04-17 22:49:28,699 INFO L87 Difference]: Start difference. First operand 1959 states and 4420 transitions. Second operand 12 states. [2020-04-17 22:49:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:31,030 INFO L93 Difference]: Finished difference Result 2515 states and 5627 transitions. [2020-04-17 22:49:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-17 22:49:31,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-04-17 22:49:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:31,035 INFO L225 Difference]: With dead ends: 2515 [2020-04-17 22:49:31,036 INFO L226 Difference]: Without dead ends: 2515 [2020-04-17 22:49:31,036 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:49:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2020-04-17 22:49:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 1941. [2020-04-17 22:49:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-04-17 22:49:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 4379 transitions. [2020-04-17 22:49:31,067 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 4379 transitions. Word has length 15 [2020-04-17 22:49:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:31,068 INFO L479 AbstractCegarLoop]: Abstraction has 1941 states and 4379 transitions. [2020-04-17 22:49:31,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 22:49:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 4379 transitions. [2020-04-17 22:49:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:31,069 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:31,070 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:31,070 INFO L427 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]=== [2020-04-17 22:49:31,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:31,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1187802783, now seen corresponding path program 6 times [2020-04-17 22:49:31,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:31,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297059989] [2020-04-17 22:49:31,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:31,518 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-04-17 22:49:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:31,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297059989] [2020-04-17 22:49:31,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:31,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:49:31,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170066479] [2020-04-17 22:49:31,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:31,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:31,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:31,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:31,613 INFO L87 Difference]: Start difference. First operand 1941 states and 4379 transitions. Second operand 13 states. [2020-04-17 22:49:32,387 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2020-04-17 22:49:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:35,780 INFO L93 Difference]: Finished difference Result 3033 states and 6772 transitions. [2020-04-17 22:49:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-17 22:49:35,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:49:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:35,803 INFO L225 Difference]: With dead ends: 3033 [2020-04-17 22:49:35,804 INFO L226 Difference]: Without dead ends: 3033 [2020-04-17 22:49:35,804 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:49:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3033 states. [2020-04-17 22:49:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3033 to 1996. [2020-04-17 22:49:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2020-04-17 22:49:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 4505 transitions. [2020-04-17 22:49:35,834 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 4505 transitions. Word has length 15 [2020-04-17 22:49:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:35,834 INFO L479 AbstractCegarLoop]: Abstraction has 1996 states and 4505 transitions. [2020-04-17 22:49:35,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 4505 transitions. [2020-04-17 22:49:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:35,835 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:35,835 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:35,835 INFO L427 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]=== [2020-04-17 22:49:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash -75667573, now seen corresponding path program 7 times [2020-04-17 22:49:35,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:35,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085316208] [2020-04-17 22:49:35,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:36,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085316208] [2020-04-17 22:49:36,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:36,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:36,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004182377] [2020-04-17 22:49:36,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:49:36,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:36,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:49:36,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:49:36,323 INFO L87 Difference]: Start difference. First operand 1996 states and 4505 transitions. Second operand 14 states. [2020-04-17 22:49:38,087 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2020-04-17 22:49:38,513 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2020-04-17 22:49:39,080 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2020-04-17 22:49:39,744 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-04-17 22:49:40,186 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2020-04-17 22:49:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:41,739 INFO L93 Difference]: Finished difference Result 2961 states and 6617 transitions. [2020-04-17 22:49:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-17 22:49:41,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:49:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:41,744 INFO L225 Difference]: With dead ends: 2961 [2020-04-17 22:49:41,744 INFO L226 Difference]: Without dead ends: 2961 [2020-04-17 22:49:41,745 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=438, Invalid=1044, Unknown=0, NotChecked=0, Total=1482 [2020-04-17 22:49:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-04-17 22:49:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1959. [2020-04-17 22:49:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2020-04-17 22:49:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 4417 transitions. [2020-04-17 22:49:41,775 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 4417 transitions. Word has length 15 [2020-04-17 22:49:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:41,776 INFO L479 AbstractCegarLoop]: Abstraction has 1959 states and 4417 transitions. [2020-04-17 22:49:41,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:49:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 4417 transitions. [2020-04-17 22:49:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:41,777 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:41,778 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:41,778 INFO L427 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]=== [2020-04-17 22:49:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1017694245, now seen corresponding path program 8 times [2020-04-17 22:49:41,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:41,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81584342] [2020-04-17 22:49:41,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:42,321 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-04-17 22:49:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:42,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81584342] [2020-04-17 22:49:42,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:42,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:49:42,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049508348] [2020-04-17 22:49:42,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:42,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:42,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:42,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:42,443 INFO L87 Difference]: Start difference. First operand 1959 states and 4417 transitions. Second operand 13 states. [2020-04-17 22:49:43,119 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2020-04-17 22:49:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:45,623 INFO L93 Difference]: Finished difference Result 2730 states and 6073 transitions. [2020-04-17 22:49:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-17 22:49:45,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:49:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:45,629 INFO L225 Difference]: With dead ends: 2730 [2020-04-17 22:49:45,629 INFO L226 Difference]: Without dead ends: 2730 [2020-04-17 22:49:45,629 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2020-04-17 22:49:45,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2020-04-17 22:49:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1912. [2020-04-17 22:49:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2020-04-17 22:49:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 4308 transitions. [2020-04-17 22:49:45,657 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 4308 transitions. Word has length 15 [2020-04-17 22:49:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:45,657 INFO L479 AbstractCegarLoop]: Abstraction has 1912 states and 4308 transitions. [2020-04-17 22:49:45,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 4308 transitions. [2020-04-17 22:49:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:45,658 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:45,659 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:45,659 INFO L427 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]=== [2020-04-17 22:49:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:45,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2013802695, now seen corresponding path program 9 times [2020-04-17 22:49:45,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:45,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898646157] [2020-04-17 22:49:45,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:46,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898646157] [2020-04-17 22:49:46,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:46,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:46,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874653075] [2020-04-17 22:49:46,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:49:46,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:49:46,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:49:46,143 INFO L87 Difference]: Start difference. First operand 1912 states and 4308 transitions. Second operand 14 states. [2020-04-17 22:49:47,869 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2020-04-17 22:49:48,497 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2020-04-17 22:49:49,070 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-04-17 22:49:49,488 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-04-17 22:49:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:51,566 INFO L93 Difference]: Finished difference Result 2649 states and 5900 transitions. [2020-04-17 22:49:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-17 22:49:51,567 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:49:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:51,571 INFO L225 Difference]: With dead ends: 2649 [2020-04-17 22:49:51,571 INFO L226 Difference]: Without dead ends: 2649 [2020-04-17 22:49:51,572 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=352, Invalid=838, Unknown=0, NotChecked=0, Total=1190 [2020-04-17 22:49:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2020-04-17 22:49:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1868. [2020-04-17 22:49:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1868 states. [2020-04-17 22:49:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 4198 transitions. [2020-04-17 22:49:51,606 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 4198 transitions. Word has length 15 [2020-04-17 22:49:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:51,609 INFO L479 AbstractCegarLoop]: Abstraction has 1868 states and 4198 transitions. [2020-04-17 22:49:51,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:49:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 4198 transitions. [2020-04-17 22:49:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:49:51,611 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:51,611 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:51,612 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1642450173, now seen corresponding path program 1 times [2020-04-17 22:49:51,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:51,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47743473] [2020-04-17 22:49:51,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:52,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47743473] [2020-04-17 22:49:52,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:52,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:49:52,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367301423] [2020-04-17 22:49:52,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:49:52,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:49:52,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:49:52,210 INFO L87 Difference]: Start difference. First operand 1868 states and 4198 transitions. Second operand 16 states. [2020-04-17 22:49:52,946 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2020-04-17 22:49:53,459 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2020-04-17 22:49:53,601 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 53 [2020-04-17 22:49:54,178 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-17 22:49:54,669 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2020-04-17 22:49:55,299 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2020-04-17 22:49:55,449 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-04-17 22:49:56,029 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-17 22:49:56,592 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-17 22:49:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:58,805 INFO L93 Difference]: Finished difference Result 3076 states and 6910 transitions. [2020-04-17 22:49:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-04-17 22:49:58,806 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:49:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:58,810 INFO L225 Difference]: With dead ends: 3076 [2020-04-17 22:49:58,810 INFO L226 Difference]: Without dead ends: 3076 [2020-04-17 22:49:58,811 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=502, Invalid=1390, Unknown=0, NotChecked=0, Total=1892 [2020-04-17 22:49:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2020-04-17 22:49:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 2060. [2020-04-17 22:49:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2060 states. [2020-04-17 22:49:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 4671 transitions. [2020-04-17 22:49:58,844 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 4671 transitions. Word has length 17 [2020-04-17 22:49:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:58,845 INFO L479 AbstractCegarLoop]: Abstraction has 2060 states and 4671 transitions. [2020-04-17 22:49:58,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:49:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 4671 transitions. [2020-04-17 22:49:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:49:58,852 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:58,852 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:58,852 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash -700596763, now seen corresponding path program 2 times [2020-04-17 22:49:58,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:58,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990559523] [2020-04-17 22:49:58,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:59,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990559523] [2020-04-17 22:49:59,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:59,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:49:59,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559915668] [2020-04-17 22:49:59,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:59,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:59,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:59,288 INFO L87 Difference]: Start difference. First operand 2060 states and 4671 transitions. Second operand 13 states. [2020-04-17 22:49:59,962 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2020-04-17 22:50:00,467 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-04-17 22:50:00,898 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-17 22:50:01,562 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-04-17 22:50:02,223 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2020-04-17 22:50:02,768 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 60 [2020-04-17 22:50:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:04,992 INFO L93 Difference]: Finished difference Result 3262 states and 7365 transitions. [2020-04-17 22:50:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-17 22:50:04,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-04-17 22:50:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:04,997 INFO L225 Difference]: With dead ends: 3262 [2020-04-17 22:50:04,997 INFO L226 Difference]: Without dead ends: 3262 [2020-04-17 22:50:04,997 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=333, Invalid=927, Unknown=0, NotChecked=0, Total=1260 [2020-04-17 22:50:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-04-17 22:50:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2057. [2020-04-17 22:50:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2020-04-17 22:50:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 4664 transitions. [2020-04-17 22:50:05,022 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 4664 transitions. Word has length 17 [2020-04-17 22:50:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:05,022 INFO L479 AbstractCegarLoop]: Abstraction has 2057 states and 4664 transitions. [2020-04-17 22:50:05,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 4664 transitions. [2020-04-17 22:50:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:05,023 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:05,023 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:05,023 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1951920263, now seen corresponding path program 3 times [2020-04-17 22:50:05,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:05,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650078905] [2020-04-17 22:50:05,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:05,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650078905] [2020-04-17 22:50:05,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:05,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:50:05,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311650581] [2020-04-17 22:50:05,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:05,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:05,477 INFO L87 Difference]: Start difference. First operand 2057 states and 4664 transitions. Second operand 13 states. [2020-04-17 22:50:06,714 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2020-04-17 22:50:07,034 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-04-17 22:50:07,684 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-04-17 22:50:08,147 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-04-17 22:50:08,391 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2020-04-17 22:50:08,791 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2020-04-17 22:50:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:10,980 INFO L93 Difference]: Finished difference Result 3023 states and 6836 transitions. [2020-04-17 22:50:10,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-04-17 22:50:10,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-04-17 22:50:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:10,986 INFO L225 Difference]: With dead ends: 3023 [2020-04-17 22:50:10,986 INFO L226 Difference]: Without dead ends: 3023 [2020-04-17 22:50:10,986 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2020-04-17 22:50:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2020-04-17 22:50:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2057. [2020-04-17 22:50:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2020-04-17 22:50:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 4664 transitions. [2020-04-17 22:50:11,012 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 4664 transitions. Word has length 17 [2020-04-17 22:50:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:11,012 INFO L479 AbstractCegarLoop]: Abstraction has 2057 states and 4664 transitions. [2020-04-17 22:50:11,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 4664 transitions. [2020-04-17 22:50:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:11,013 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:11,014 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:11,014 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:11,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:11,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1668168767, now seen corresponding path program 4 times [2020-04-17 22:50:11,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:11,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88143683] [2020-04-17 22:50:11,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:11,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88143683] [2020-04-17 22:50:11,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:11,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:50:11,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756652813] [2020-04-17 22:50:11,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:11,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:11,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:11,521 INFO L87 Difference]: Start difference. First operand 2057 states and 4664 transitions. Second operand 13 states. [2020-04-17 22:50:12,338 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-04-17 22:50:14,383 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-04-17 22:50:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:17,299 INFO L93 Difference]: Finished difference Result 2988 states and 6763 transitions. [2020-04-17 22:50:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-17 22:50:17,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-04-17 22:50:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:17,305 INFO L225 Difference]: With dead ends: 2988 [2020-04-17 22:50:17,305 INFO L226 Difference]: Without dead ends: 2988 [2020-04-17 22:50:17,306 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=303, Invalid=957, Unknown=0, NotChecked=0, Total=1260 [2020-04-17 22:50:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-04-17 22:50:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2057. [2020-04-17 22:50:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2020-04-17 22:50:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 4664 transitions. [2020-04-17 22:50:17,339 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 4664 transitions. Word has length 17 [2020-04-17 22:50:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:17,339 INFO L479 AbstractCegarLoop]: Abstraction has 2057 states and 4664 transitions. [2020-04-17 22:50:17,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 4664 transitions. [2020-04-17 22:50:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:17,341 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:17,341 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:17,341 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2022226781, now seen corresponding path program 5 times [2020-04-17 22:50:17,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:17,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213623634] [2020-04-17 22:50:17,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:17,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213623634] [2020-04-17 22:50:17,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:17,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:50:17,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126536036] [2020-04-17 22:50:17,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:17,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:17,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:17,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:17,774 INFO L87 Difference]: Start difference. First operand 2057 states and 4664 transitions. Second operand 13 states. [2020-04-17 22:50:20,197 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-04-17 22:50:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:22,538 INFO L93 Difference]: Finished difference Result 3054 states and 6902 transitions. [2020-04-17 22:50:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-04-17 22:50:22,539 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-04-17 22:50:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:22,543 INFO L225 Difference]: With dead ends: 3054 [2020-04-17 22:50:22,543 INFO L226 Difference]: Without dead ends: 3054 [2020-04-17 22:50:22,543 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2020-04-17 22:50:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2020-04-17 22:50:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2057. [2020-04-17 22:50:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2020-04-17 22:50:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 4664 transitions. [2020-04-17 22:50:22,578 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 4664 transitions. Word has length 17 [2020-04-17 22:50:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:22,578 INFO L479 AbstractCegarLoop]: Abstraction has 2057 states and 4664 transitions. [2020-04-17 22:50:22,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 4664 transitions. [2020-04-17 22:50:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:22,579 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:22,580 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:22,580 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1209734639, now seen corresponding path program 6 times [2020-04-17 22:50:22,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:22,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516030591] [2020-04-17 22:50:22,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:22,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516030591] [2020-04-17 22:50:22,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:22,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:22,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685012907] [2020-04-17 22:50:22,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:22,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:22,970 INFO L87 Difference]: Start difference. First operand 2057 states and 4664 transitions. Second operand 14 states. [2020-04-17 22:50:24,520 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-04-17 22:50:24,679 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2020-04-17 22:50:25,428 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-04-17 22:50:25,978 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-04-17 22:50:26,394 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2020-04-17 22:50:26,634 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 63 [2020-04-17 22:50:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:29,362 INFO L93 Difference]: Finished difference Result 3778 states and 8616 transitions. [2020-04-17 22:50:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-17 22:50:29,363 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2020-04-17 22:50:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:29,368 INFO L225 Difference]: With dead ends: 3778 [2020-04-17 22:50:29,368 INFO L226 Difference]: Without dead ends: 3778 [2020-04-17 22:50:29,368 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=399, Invalid=1241, Unknown=0, NotChecked=0, Total=1640 [2020-04-17 22:50:29,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2020-04-17 22:50:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 2079. [2020-04-17 22:50:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-04-17 22:50:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 4712 transitions. [2020-04-17 22:50:29,408 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 4712 transitions. Word has length 17 [2020-04-17 22:50:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:29,408 INFO L479 AbstractCegarLoop]: Abstraction has 2079 states and 4712 transitions. [2020-04-17 22:50:29,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 4712 transitions. [2020-04-17 22:50:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:29,410 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:29,410 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:29,410 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:29,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1403185471, now seen corresponding path program 7 times [2020-04-17 22:50:29,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:29,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393913573] [2020-04-17 22:50:29,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:29,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393913573] [2020-04-17 22:50:29,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:29,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:29,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766547859] [2020-04-17 22:50:29,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:29,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:29,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:29,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:29,898 INFO L87 Difference]: Start difference. First operand 2079 states and 4712 transitions. Second operand 16 states. [2020-04-17 22:50:30,623 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2020-04-17 22:50:31,019 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2020-04-17 22:50:31,621 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2020-04-17 22:50:32,022 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2020-04-17 22:50:32,754 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2020-04-17 22:50:33,387 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2020-04-17 22:50:33,832 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2020-04-17 22:50:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:35,983 INFO L93 Difference]: Finished difference Result 3576 states and 8053 transitions. [2020-04-17 22:50:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-04-17 22:50:35,986 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:50:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:35,990 INFO L225 Difference]: With dead ends: 3576 [2020-04-17 22:50:35,990 INFO L226 Difference]: Without dead ends: 3576 [2020-04-17 22:50:35,991 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2020-04-17 22:50:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3576 states. [2020-04-17 22:50:36,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3576 to 2090. [2020-04-17 22:50:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-04-17 22:50:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 4744 transitions. [2020-04-17 22:50:36,017 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 4744 transitions. Word has length 17 [2020-04-17 22:50:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:36,017 INFO L479 AbstractCegarLoop]: Abstraction has 2090 states and 4744 transitions. [2020-04-17 22:50:36,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 4744 transitions. [2020-04-17 22:50:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:36,018 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:36,018 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:36,018 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:36,019 INFO L82 PathProgramCache]: Analyzing trace with hash 548734889, now seen corresponding path program 8 times [2020-04-17 22:50:36,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:36,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327857862] [2020-04-17 22:50:36,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:36,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327857862] [2020-04-17 22:50:36,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:36,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:36,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600498190] [2020-04-17 22:50:36,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:50:36,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:36,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:50:36,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:50:36,381 INFO L87 Difference]: Start difference. First operand 2090 states and 4744 transitions. Second operand 15 states. [2020-04-17 22:50:37,099 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-04-17 22:50:37,476 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2020-04-17 22:50:37,804 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-04-17 22:50:38,175 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-17 22:50:38,304 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 49 [2020-04-17 22:50:38,705 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2020-04-17 22:50:39,465 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2020-04-17 22:50:40,121 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-17 22:50:40,576 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-17 22:50:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:42,825 INFO L93 Difference]: Finished difference Result 3720 states and 8421 transitions. [2020-04-17 22:50:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-04-17 22:50:42,825 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:50:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:42,830 INFO L225 Difference]: With dead ends: 3720 [2020-04-17 22:50:42,830 INFO L226 Difference]: Without dead ends: 3720 [2020-04-17 22:50:42,831 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=432, Invalid=1208, Unknown=0, NotChecked=0, Total=1640 [2020-04-17 22:50:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2020-04-17 22:50:42,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 2086. [2020-04-17 22:50:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2020-04-17 22:50:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 4734 transitions. [2020-04-17 22:50:42,870 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 4734 transitions. Word has length 17 [2020-04-17 22:50:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:42,870 INFO L479 AbstractCegarLoop]: Abstraction has 2086 states and 4734 transitions. [2020-04-17 22:50:42,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:50:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 4734 transitions. [2020-04-17 22:50:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:42,871 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:42,871 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:42,872 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:42,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash 828014845, now seen corresponding path program 9 times [2020-04-17 22:50:42,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:42,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747739677] [2020-04-17 22:50:42,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:43,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747739677] [2020-04-17 22:50:43,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:43,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:43,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910198910] [2020-04-17 22:50:43,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:43,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:43,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:43,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:43,343 INFO L87 Difference]: Start difference. First operand 2086 states and 4734 transitions. Second operand 16 states. [2020-04-17 22:50:43,934 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2020-04-17 22:50:44,233 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2020-04-17 22:50:44,763 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2020-04-17 22:50:45,149 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2020-04-17 22:50:45,740 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2020-04-17 22:50:46,302 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2020-04-17 22:50:46,719 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2020-04-17 22:50:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:48,641 INFO L93 Difference]: Finished difference Result 3324 states and 7492 transitions. [2020-04-17 22:50:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-04-17 22:50:48,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:50:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:48,646 INFO L225 Difference]: With dead ends: 3324 [2020-04-17 22:50:48,646 INFO L226 Difference]: Without dead ends: 3324 [2020-04-17 22:50:48,647 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2020-04-17 22:50:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2020-04-17 22:50:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 2063. [2020-04-17 22:50:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2020-04-17 22:50:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 4672 transitions. [2020-04-17 22:50:48,671 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 4672 transitions. Word has length 17 [2020-04-17 22:50:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:48,671 INFO L479 AbstractCegarLoop]: Abstraction has 2063 states and 4672 transitions. [2020-04-17 22:50:48,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 4672 transitions. [2020-04-17 22:50:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:48,672 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:48,672 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:48,672 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:48,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1515032091, now seen corresponding path program 10 times [2020-04-17 22:50:48,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:48,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459520254] [2020-04-17 22:50:48,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:49,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459520254] [2020-04-17 22:50:49,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:49,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:49,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140494630] [2020-04-17 22:50:49,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:50:49,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:50:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:50:49,190 INFO L87 Difference]: Start difference. First operand 2063 states and 4672 transitions. Second operand 15 states. [2020-04-17 22:50:50,027 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2020-04-17 22:50:50,313 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-04-17 22:50:50,666 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-17 22:50:51,162 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2020-04-17 22:50:51,781 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2020-04-17 22:50:52,370 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-17 22:50:52,532 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 48 [2020-04-17 22:50:52,805 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-17 22:50:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:54,644 INFO L93 Difference]: Finished difference Result 3446 states and 7808 transitions. [2020-04-17 22:50:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-04-17 22:50:54,645 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:50:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:54,649 INFO L225 Difference]: With dead ends: 3446 [2020-04-17 22:50:54,650 INFO L226 Difference]: Without dead ends: 3446 [2020-04-17 22:50:54,650 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2020-04-17 22:50:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2020-04-17 22:50:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 2022. [2020-04-17 22:50:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2020-04-17 22:50:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 4578 transitions. [2020-04-17 22:50:54,674 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 4578 transitions. Word has length 17 [2020-04-17 22:50:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:54,675 INFO L479 AbstractCegarLoop]: Abstraction has 2022 states and 4578 transitions. [2020-04-17 22:50:54,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:50:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 4578 transitions. [2020-04-17 22:50:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:50:54,676 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:54,676 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:54,676 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1173142552, now seen corresponding path program 1 times [2020-04-17 22:50:54,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:54,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761675003] [2020-04-17 22:50:54,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:54,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761675003] [2020-04-17 22:50:54,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:54,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:54,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312761817] [2020-04-17 22:50:54,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:50:54,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:50:54,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:50:54,985 INFO L87 Difference]: Start difference. First operand 2022 states and 4578 transitions. Second operand 15 states. [2020-04-17 22:50:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:59,868 INFO L93 Difference]: Finished difference Result 2812 states and 6277 transitions. [2020-04-17 22:50:59,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-17 22:50:59,868 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-17 22:50:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:59,872 INFO L225 Difference]: With dead ends: 2812 [2020-04-17 22:50:59,872 INFO L226 Difference]: Without dead ends: 2812 [2020-04-17 22:50:59,873 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=619, Invalid=1451, Unknown=0, NotChecked=0, Total=2070 [2020-04-17 22:50:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2020-04-17 22:50:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2048. [2020-04-17 22:50:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2020-04-17 22:50:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 4636 transitions. [2020-04-17 22:50:59,913 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 4636 transitions. Word has length 18 [2020-04-17 22:50:59,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:59,913 INFO L479 AbstractCegarLoop]: Abstraction has 2048 states and 4636 transitions. [2020-04-17 22:50:59,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:50:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 4636 transitions. [2020-04-17 22:50:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:50:59,914 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:59,914 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:59,914 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:59,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:59,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2034764068, now seen corresponding path program 2 times [2020-04-17 22:50:59,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:59,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786610578] [2020-04-17 22:50:59,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:00,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786610578] [2020-04-17 22:51:00,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:00,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:00,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328018924] [2020-04-17 22:51:00,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:00,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:00,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:00,169 INFO L87 Difference]: Start difference. First operand 2048 states and 4636 transitions. Second operand 15 states. [2020-04-17 22:51:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:05,346 INFO L93 Difference]: Finished difference Result 2882 states and 6431 transitions. [2020-04-17 22:51:05,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-04-17 22:51:05,346 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-17 22:51:05,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:05,350 INFO L225 Difference]: With dead ends: 2882 [2020-04-17 22:51:05,350 INFO L226 Difference]: Without dead ends: 2882 [2020-04-17 22:51:05,351 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=689, Invalid=1663, Unknown=0, NotChecked=0, Total=2352 [2020-04-17 22:51:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-04-17 22:51:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2060. [2020-04-17 22:51:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2060 states. [2020-04-17 22:51:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 4665 transitions. [2020-04-17 22:51:05,377 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 4665 transitions. Word has length 18 [2020-04-17 22:51:05,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:05,377 INFO L479 AbstractCegarLoop]: Abstraction has 2060 states and 4665 transitions. [2020-04-17 22:51:05,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 4665 transitions. [2020-04-17 22:51:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:51:05,379 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:05,379 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:05,379 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:05,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:05,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1960890584, now seen corresponding path program 3 times [2020-04-17 22:51:05,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:05,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062739271] [2020-04-17 22:51:05,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:05,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062739271] [2020-04-17 22:51:05,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:05,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:05,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950289717] [2020-04-17 22:51:05,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:05,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:05,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:05,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:05,665 INFO L87 Difference]: Start difference. First operand 2060 states and 4665 transitions. Second operand 15 states. [2020-04-17 22:51:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:10,768 INFO L93 Difference]: Finished difference Result 2790 states and 6233 transitions. [2020-04-17 22:51:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-17 22:51:10,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-17 22:51:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:10,772 INFO L225 Difference]: With dead ends: 2790 [2020-04-17 22:51:10,773 INFO L226 Difference]: Without dead ends: 2790 [2020-04-17 22:51:10,773 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=541, Invalid=1351, Unknown=0, NotChecked=0, Total=1892 [2020-04-17 22:51:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2020-04-17 22:51:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2070. [2020-04-17 22:51:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2020-04-17 22:51:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4688 transitions. [2020-04-17 22:51:10,799 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4688 transitions. Word has length 18 [2020-04-17 22:51:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:10,799 INFO L479 AbstractCegarLoop]: Abstraction has 2070 states and 4688 transitions. [2020-04-17 22:51:10,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4688 transitions. [2020-04-17 22:51:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:51:10,800 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:10,800 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:10,800 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1075092764, now seen corresponding path program 4 times [2020-04-17 22:51:10,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:10,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211003408] [2020-04-17 22:51:10,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:11,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211003408] [2020-04-17 22:51:11,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:11,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:11,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911740993] [2020-04-17 22:51:11,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:11,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:11,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:11,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:11,112 INFO L87 Difference]: Start difference. First operand 2070 states and 4688 transitions. Second operand 15 states. [2020-04-17 22:51:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:15,810 INFO L93 Difference]: Finished difference Result 2834 states and 6329 transitions. [2020-04-17 22:51:15,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-17 22:51:15,811 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-17 22:51:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:15,815 INFO L225 Difference]: With dead ends: 2834 [2020-04-17 22:51:15,815 INFO L226 Difference]: Without dead ends: 2834 [2020-04-17 22:51:15,816 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=506, Invalid=1216, Unknown=0, NotChecked=0, Total=1722 [2020-04-17 22:51:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-04-17 22:51:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2082. [2020-04-17 22:51:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2020-04-17 22:51:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 4717 transitions. [2020-04-17 22:51:15,843 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 4717 transitions. Word has length 18 [2020-04-17 22:51:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:15,843 INFO L479 AbstractCegarLoop]: Abstraction has 2082 states and 4717 transitions. [2020-04-17 22:51:15,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 4717 transitions. [2020-04-17 22:51:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:51:15,844 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:15,844 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:15,844 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -91766104, now seen corresponding path program 5 times [2020-04-17 22:51:15,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:15,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952407308] [2020-04-17 22:51:15,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:16,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952407308] [2020-04-17 22:51:16,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:16,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:16,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613045897] [2020-04-17 22:51:16,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:16,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:16,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:16,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:16,143 INFO L87 Difference]: Start difference. First operand 2082 states and 4717 transitions. Second operand 15 states. [2020-04-17 22:51:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:20,491 INFO L93 Difference]: Finished difference Result 2896 states and 6473 transitions. [2020-04-17 22:51:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-17 22:51:20,492 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-17 22:51:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:20,496 INFO L225 Difference]: With dead ends: 2896 [2020-04-17 22:51:20,496 INFO L226 Difference]: Without dead ends: 2896 [2020-04-17 22:51:20,497 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=505, Invalid=1217, Unknown=0, NotChecked=0, Total=1722 [2020-04-17 22:51:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-04-17 22:51:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2093. [2020-04-17 22:51:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-04-17 22:51:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 4743 transitions. [2020-04-17 22:51:20,519 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 4743 transitions. Word has length 18 [2020-04-17 22:51:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:20,519 INFO L479 AbstractCegarLoop]: Abstraction has 2093 states and 4743 transitions. [2020-04-17 22:51:20,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 4743 transitions. [2020-04-17 22:51:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:51:20,521 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:20,521 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:20,521 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:20,522 INFO L82 PathProgramCache]: Analyzing trace with hash 347595492, now seen corresponding path program 6 times [2020-04-17 22:51:20,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:20,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161498606] [2020-04-17 22:51:20,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:20,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161498606] [2020-04-17 22:51:20,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:20,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:20,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529364698] [2020-04-17 22:51:20,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:20,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:20,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:20,843 INFO L87 Difference]: Start difference. First operand 2093 states and 4743 transitions. Second operand 15 states. [2020-04-17 22:51:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:25,793 INFO L93 Difference]: Finished difference Result 2959 states and 6599 transitions. [2020-04-17 22:51:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-17 22:51:25,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-17 22:51:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:25,798 INFO L225 Difference]: With dead ends: 2959 [2020-04-17 22:51:25,798 INFO L226 Difference]: Without dead ends: 2959 [2020-04-17 22:51:25,799 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=582, Invalid=1398, Unknown=0, NotChecked=0, Total=1980 [2020-04-17 22:51:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-04-17 22:51:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2101. [2020-04-17 22:51:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2020-04-17 22:51:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4761 transitions. [2020-04-17 22:51:25,825 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4761 transitions. Word has length 18 [2020-04-17 22:51:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:25,825 INFO L479 AbstractCegarLoop]: Abstraction has 2101 states and 4761 transitions. [2020-04-17 22:51:25,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4761 transitions. [2020-04-17 22:51:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:51:25,827 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:25,827 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:25,827 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:25,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1785956776, now seen corresponding path program 7 times [2020-04-17 22:51:25,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:25,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401926891] [2020-04-17 22:51:25,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:26,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401926891] [2020-04-17 22:51:26,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:26,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:26,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980620798] [2020-04-17 22:51:26,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:26,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:26,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:26,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:26,155 INFO L87 Difference]: Start difference. First operand 2101 states and 4761 transitions. Second operand 15 states. [2020-04-17 22:51:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:30,972 INFO L93 Difference]: Finished difference Result 2663 states and 5968 transitions. [2020-04-17 22:51:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-04-17 22:51:30,972 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-17 22:51:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:30,976 INFO L225 Difference]: With dead ends: 2663 [2020-04-17 22:51:30,976 INFO L226 Difference]: Without dead ends: 2663 [2020-04-17 22:51:30,977 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2020-04-17 22:51:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2020-04-17 22:51:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2061. [2020-04-17 22:51:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2020-04-17 22:51:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4668 transitions. [2020-04-17 22:51:31,024 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4668 transitions. Word has length 18 [2020-04-17 22:51:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:31,024 INFO L479 AbstractCegarLoop]: Abstraction has 2061 states and 4668 transitions. [2020-04-17 22:51:31,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4668 transitions. [2020-04-17 22:51:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:51:31,025 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:31,025 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:31,026 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1304394659, now seen corresponding path program 1 times [2020-04-17 22:51:31,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:31,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365763418] [2020-04-17 22:51:31,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:31,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365763418] [2020-04-17 22:51:31,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:31,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:31,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930549122] [2020-04-17 22:51:31,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:31,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:31,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:31,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:31,493 INFO L87 Difference]: Start difference. First operand 2061 states and 4668 transitions. Second operand 15 states. [2020-04-17 22:51:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:34,866 INFO L93 Difference]: Finished difference Result 3498 states and 7844 transitions. [2020-04-17 22:51:34,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 22:51:34,866 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-04-17 22:51:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:34,872 INFO L225 Difference]: With dead ends: 3498 [2020-04-17 22:51:34,872 INFO L226 Difference]: Without dead ends: 3498 [2020-04-17 22:51:34,872 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:51:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2020-04-17 22:51:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 2101. [2020-04-17 22:51:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2020-04-17 22:51:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4752 transitions. [2020-04-17 22:51:34,926 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4752 transitions. Word has length 18 [2020-04-17 22:51:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:34,926 INFO L479 AbstractCegarLoop]: Abstraction has 2101 states and 4752 transitions. [2020-04-17 22:51:34,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4752 transitions. [2020-04-17 22:51:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-17 22:51:34,927 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:34,927 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:34,927 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:34,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:34,927 INFO L82 PathProgramCache]: Analyzing trace with hash 901430712, now seen corresponding path program 1 times [2020-04-17 22:51:34,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:34,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66428237] [2020-04-17 22:51:34,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:35,759 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 52 [2020-04-17 22:51:35,908 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2020-04-17 22:51:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:36,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66428237] [2020-04-17 22:51:36,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:36,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:36,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944736045] [2020-04-17 22:51:36,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:36,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:36,190 INFO L87 Difference]: Start difference. First operand 2101 states and 4752 transitions. Second operand 16 states. [2020-04-17 22:51:36,501 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2020-04-17 22:51:36,816 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2020-04-17 22:51:37,227 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2020-04-17 22:51:37,765 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2020-04-17 22:51:38,226 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2020-04-17 22:51:38,778 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2020-04-17 22:51:39,433 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2020-04-17 22:51:40,084 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 73 [2020-04-17 22:51:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:42,328 INFO L93 Difference]: Finished difference Result 3375 states and 7603 transitions. [2020-04-17 22:51:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-17 22:51:42,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2020-04-17 22:51:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:42,333 INFO L225 Difference]: With dead ends: 3375 [2020-04-17 22:51:42,333 INFO L226 Difference]: Without dead ends: 3375 [2020-04-17 22:51:42,334 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2020-04-17 22:51:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states. [2020-04-17 22:51:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 2206. [2020-04-17 22:51:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2020-04-17 22:51:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 5010 transitions. [2020-04-17 22:51:42,358 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 5010 transitions. Word has length 20 [2020-04-17 22:51:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:42,359 INFO L479 AbstractCegarLoop]: Abstraction has 2206 states and 5010 transitions. [2020-04-17 22:51:42,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 5010 transitions. [2020-04-17 22:51:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-17 22:51:42,360 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:42,360 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:42,360 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:42,361 INFO L82 PathProgramCache]: Analyzing trace with hash 998654928, now seen corresponding path program 2 times [2020-04-17 22:51:42,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:42,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829909300] [2020-04-17 22:51:42,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:43,059 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 39 [2020-04-17 22:51:43,187 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 35 [2020-04-17 22:51:43,395 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2020-04-17 22:51:43,655 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 43 [2020-04-17 22:51:43,878 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 42 [2020-04-17 22:51:44,034 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2020-04-17 22:51:44,187 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2020-04-17 22:51:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:44,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829909300] [2020-04-17 22:51:44,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:44,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-17 22:51:44,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745749886] [2020-04-17 22:51:44,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 22:51:44,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:44,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 22:51:44,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2020-04-17 22:51:44,289 INFO L87 Difference]: Start difference. First operand 2206 states and 5010 transitions. Second operand 19 states. [2020-04-17 22:51:45,712 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-04-17 22:51:45,891 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-04-17 22:51:46,254 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2020-04-17 22:51:46,554 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-04-17 22:51:47,026 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-04-17 22:51:47,169 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2020-04-17 22:51:47,813 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-04-17 22:51:48,155 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2020-04-17 22:51:48,382 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2020-04-17 22:51:49,029 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2020-04-17 22:51:49,207 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2020-04-17 22:51:49,410 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-04-17 22:51:49,698 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 67 [2020-04-17 22:51:50,149 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2020-04-17 22:51:50,381 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-04-17 22:51:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:53,864 INFO L93 Difference]: Finished difference Result 4079 states and 9228 transitions. [2020-04-17 22:51:53,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-04-17 22:51:53,865 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2020-04-17 22:51:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:53,870 INFO L225 Difference]: With dead ends: 4079 [2020-04-17 22:51:53,870 INFO L226 Difference]: Without dead ends: 4079 [2020-04-17 22:51:53,871 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=662, Invalid=2530, Unknown=0, NotChecked=0, Total=3192 [2020-04-17 22:51:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2020-04-17 22:51:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 2241. [2020-04-17 22:51:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2241 states. [2020-04-17 22:51:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 5095 transitions. [2020-04-17 22:51:53,902 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 5095 transitions. Word has length 20 [2020-04-17 22:51:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:53,902 INFO L479 AbstractCegarLoop]: Abstraction has 2241 states and 5095 transitions. [2020-04-17 22:51:53,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-17 22:51:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 5095 transitions. [2020-04-17 22:51:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-17 22:51:53,903 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:53,903 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:53,904 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:53,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1427266118, now seen corresponding path program 3 times [2020-04-17 22:51:53,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:53,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959214498] [2020-04-17 22:51:53,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:54,497 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-04-17 22:51:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:54,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959214498] [2020-04-17 22:51:54,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:54,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:51:54,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190138066] [2020-04-17 22:51:54,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:51:54,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:51:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:51:54,992 INFO L87 Difference]: Start difference. First operand 2241 states and 5095 transitions. Second operand 17 states. [2020-04-17 22:51:56,552 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 Received shutdown request... [2020-04-17 22:51:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-04-17 22:51:58,384 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-17 22:51:58,388 WARN L228 ceAbstractionStarter]: Timeout [2020-04-17 22:51:58,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.04 10:51:58 BasicIcfg [2020-04-17 22:51:58,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-17 22:51:58,390 INFO L168 Benchmark]: Toolchain (without parser) took 249688.11 ms. Allocated memory was 146.3 MB in the beginning and 425.7 MB in the end (delta: 279.4 MB). Free memory was 102.3 MB in the beginning and 71.1 MB in the end (delta: 31.2 MB). Peak memory consumption was 310.7 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:58,390 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-04-17 22:51:58,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 991.26 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 131.2 MB in the end (delta: -30.8 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:58,391 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.12 ms. Allocated memory is still 204.5 MB. Free memory was 131.2 MB in the beginning and 127.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:58,391 INFO L168 Benchmark]: Boogie Preprocessor took 99.22 ms. Allocated memory is still 204.5 MB. Free memory was 127.2 MB in the beginning and 123.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:58,392 INFO L168 Benchmark]: RCFGBuilder took 1134.66 ms. Allocated memory was 204.5 MB in the beginning and 234.4 MB in the end (delta: 29.9 MB). Free memory was 123.2 MB in the beginning and 146.9 MB in the end (delta: -23.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:58,392 INFO L168 Benchmark]: TraceAbstraction took 247309.26 ms. Allocated memory was 234.4 MB in the beginning and 425.7 MB in the end (delta: 191.4 MB). Free memory was 146.9 MB in the beginning and 71.1 MB in the end (delta: 75.8 MB). Peak memory consumption was 267.1 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:58,396 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 991.26 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 131.2 MB in the end (delta: -30.8 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 122.12 ms. Allocated memory is still 204.5 MB. Free memory was 131.2 MB in the beginning and 127.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.22 ms. Allocated memory is still 204.5 MB. Free memory was 127.2 MB in the beginning and 123.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1134.66 ms. Allocated memory was 204.5 MB in the beginning and 234.4 MB in the end (delta: 29.9 MB). Free memory was 123.2 MB in the beginning and 146.9 MB in the end (delta: -23.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247309.26 ms. Allocated memory was 234.4 MB in the beginning and 425.7 MB in the end (delta: 191.4 MB). Free memory was 146.9 MB in the beginning and 71.1 MB in the end (delta: 75.8 MB). Peak memory consumption was 267.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 53.5s, 426 ProgramPointsBefore, 107 ProgramPointsAfterwards, 455 TransitionsBefore, 121 TransitionsAfterwards, 31742 CoEnabledTransitionPairs, 16 FixpointIterations, 119 TrivialSequentialCompositions, 225 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 68 ConcurrentYvCompositions, 15 ChoiceCompositions, 16841 VarBasedMoverChecksPositive, 453 VarBasedMoverChecksNegative, 283 SemBasedMoverChecksPositive, 350 SemBasedMoverChecksNegative, 16 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 37.0s, 0 MoverChecksTotal, 121870 CheckedPairsTotal, 437 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 (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1087]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1085]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (2241states) and FLOYD_HOARE automaton (currently 29 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 423 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 247.0s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 174.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 53.6s, HoareTripleCheckerStatistics: 4686 SDtfs, 22084 SDslu, 13545 SDs, 0 SdLazy, 83106 SolverSat, 1696 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1360 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 1301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7647 ImplicationChecksByTransitivity, 80.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2241occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 41 MinimizatonAttempts, 35425 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 643 NumberOfCodeBlocks, 643 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 601 ConstructedInterpolants, 0 QuantifiedInterpolants, 240285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown