/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:16:55,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:16:55,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:16:55,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:16:55,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:16:55,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:16:55,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:16:55,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:16:55,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:16:55,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:16:55,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:16:55,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:16:55,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:16:55,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:16:55,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:16:55,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:16:55,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:16:55,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:16:55,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:16:55,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:16:55,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:16:55,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:16:55,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:16:55,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:16:55,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:16:55,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:16:55,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:16:55,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:16:55,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:16:55,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:16:55,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:16:55,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:16:55,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:16:55,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:16:55,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:16:55,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:16:55,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:16:55,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:16:55,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:16:55,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:16:55,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:16:55,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 08:16:55,700 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:16:55,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:16:55,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:16:55,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:16:55,702 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:16:55,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:16:55,703 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:16:55,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:16:55,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:16:55,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:16:55,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:16:55,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:16:55,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:16:55,704 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:16:55,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:16:55,705 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:16:55,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:16:55,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:16:55,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:16:55,706 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:16:55,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:16:55,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:16:55,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:16:55,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:16:55,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:16:55,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:16:55,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:16:55,708 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:16:55,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:16:55,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:16:55,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:16:56,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:16:56,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:16:56,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:16:56,009 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:16:56,010 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2019-12-27 08:16:56,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/679144bcf/c45cbb72512543949310f7d060e7bd6d/FLAG98b6a7112 [2019-12-27 08:16:56,672 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:16:56,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2019-12-27 08:16:56,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/679144bcf/c45cbb72512543949310f7d060e7bd6d/FLAG98b6a7112 [2019-12-27 08:16:56,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/679144bcf/c45cbb72512543949310f7d060e7bd6d [2019-12-27 08:16:56,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:16:56,904 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:16:56,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:16:56,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:16:56,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:16:56,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:16:56" (1/1) ... [2019-12-27 08:16:56,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eef8c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:56, skipping insertion in model container [2019-12-27 08:16:56,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:16:56" (1/1) ... [2019-12-27 08:16:56,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:16:56,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:16:57,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:16:57,736 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:16:57,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:16:58,178 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:16:58,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58 WrapperNode [2019-12-27 08:16:58,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:16:58,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:16:58,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:16:58,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:16:58,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... [2019-12-27 08:16:58,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... [2019-12-27 08:16:58,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:16:58,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:16:58,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:16:58,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:16:58,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... [2019-12-27 08:16:58,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... [2019-12-27 08:16:58,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... [2019-12-27 08:16:58,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... [2019-12-27 08:16:58,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... [2019-12-27 08:16:58,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... [2019-12-27 08:16:58,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... [2019-12-27 08:16:58,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:16:58,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:16:58,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:16:58,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:16:58,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:16:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:16:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 08:16:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 08:16:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 08:16:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:16:58,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:16:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 08:16:58,396 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 08:16:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:16:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:16:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 08:16:58,398 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:16:59,198 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:16:59,199 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 08:16:59,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:16:59 BoogieIcfgContainer [2019-12-27 08:16:59,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:16:59,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:16:59,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:16:59,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:16:59,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:16:56" (1/3) ... [2019-12-27 08:16:59,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9db746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:16:59, skipping insertion in model container [2019-12-27 08:16:59,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:16:58" (2/3) ... [2019-12-27 08:16:59,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9db746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:16:59, skipping insertion in model container [2019-12-27 08:16:59,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:16:59" (3/3) ... [2019-12-27 08:16:59,207 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2019-12-27 08:16:59,215 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:16:59,215 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:16:59,222 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 08:16:59,223 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:16:59,255 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,255 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,255 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,255 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,258 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,258 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,258 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,258 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,259 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,259 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,259 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,259 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,259 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,260 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,260 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,260 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,261 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,261 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,261 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,261 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,261 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,262 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,262 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,262 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,263 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,263 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,264 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,264 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,264 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,264 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,264 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,265 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,265 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,265 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,265 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,266 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,266 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,266 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,266 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,266 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,267 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,267 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,267 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,267 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,268 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,268 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,268 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,268 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,269 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,269 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,269 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,269 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,270 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,270 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,270 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,270 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,271 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,271 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,271 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,272 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,272 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,276 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,276 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,276 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,277 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,277 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,277 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,277 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,278 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,278 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,278 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,278 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,278 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,286 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,286 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,286 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,287 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,287 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,287 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,287 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,288 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,288 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,288 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,288 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,289 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:59,319 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 08:16:59,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:16:59,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:16:59,341 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:16:59,341 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:16:59,342 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:16:59,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:16:59,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:16:59,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:16:59,370 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 155 transitions [2019-12-27 08:16:59,375 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-27 08:16:59,458 INFO L132 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-27 08:16:59,458 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 08:16:59,468 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 08:16:59,476 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-27 08:16:59,547 INFO L132 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-27 08:16:59,548 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 08:16:59,552 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 08:16:59,560 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2884 [2019-12-27 08:16:59,561 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:17:03,399 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 08:17:03,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:17:03,445 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 08:17:03,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:17:03,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:17:03,496 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-27 08:17:04,456 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-27 08:17:05,233 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 08:17:05,531 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 08:17:05,705 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-27 08:17:06,248 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-12-27 08:17:06,427 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-27 08:17:07,068 WARN L192 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2019-12-27 08:17:07,107 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 08:17:07,365 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-27 08:17:07,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:17:07,385 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 08:17:07,629 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-27 08:17:07,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:17:07,630 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 08:17:07,631 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:250, output treesize:222 [2019-12-27 08:17:07,876 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-27 08:17:09,062 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2019-12-27 08:17:09,086 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 08:17:09,671 WARN L192 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 08:17:09,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:17:09,680 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 08:17:10,144 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 08:17:10,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 08:17:10,146 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 08:17:10,146 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2019-12-27 08:17:10,615 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 08:17:10,884 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-27 08:17:11,139 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-27 08:17:11,150 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5217 [2019-12-27 08:17:11,150 INFO L214 etLargeBlockEncoding]: Total number of compositions: 160 [2019-12-27 08:17:11,154 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 41 transitions [2019-12-27 08:17:11,197 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 462 states. [2019-12-27 08:17:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states. [2019-12-27 08:17:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 08:17:11,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:11,208 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 08:17:11,208 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:11,215 INFO L82 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2019-12-27 08:17:11,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:11,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219815443] [2019-12-27 08:17:11,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:11,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219815443] [2019-12-27 08:17:11,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:11,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 08:17:11,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810440049] [2019-12-27 08:17:11,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 08:17:11,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 08:17:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 08:17:11,613 INFO L87 Difference]: Start difference. First operand 462 states. Second operand 2 states. [2019-12-27 08:17:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:11,685 INFO L93 Difference]: Finished difference Result 460 states and 1126 transitions. [2019-12-27 08:17:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 08:17:11,686 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 08:17:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:11,705 INFO L225 Difference]: With dead ends: 460 [2019-12-27 08:17:11,705 INFO L226 Difference]: Without dead ends: 385 [2019-12-27 08:17:11,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 08:17:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-27 08:17:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-12-27 08:17:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-12-27 08:17:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2019-12-27 08:17:11,810 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2019-12-27 08:17:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:11,811 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2019-12-27 08:17:11,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 08:17:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2019-12-27 08:17:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 08:17:11,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:11,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 08:17:11,812 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash 17095183, now seen corresponding path program 1 times [2019-12-27 08:17:11,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:11,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264419691] [2019-12-27 08:17:11,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:12,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264419691] [2019-12-27 08:17:12,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:12,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:17:12,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245799152] [2019-12-27 08:17:12,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:17:12,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:12,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:17:12,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:17:12,004 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2019-12-27 08:17:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:12,168 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2019-12-27 08:17:12,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:17:12,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 08:17:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:12,175 INFO L225 Difference]: With dead ends: 540 [2019-12-27 08:17:12,176 INFO L226 Difference]: Without dead ends: 540 [2019-12-27 08:17:12,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:17:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-27 08:17:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2019-12-27 08:17:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-27 08:17:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2019-12-27 08:17:12,205 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2019-12-27 08:17:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:12,206 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2019-12-27 08:17:12,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:17:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2019-12-27 08:17:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 08:17:12,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:12,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 08:17:12,207 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash -751398463, now seen corresponding path program 1 times [2019-12-27 08:17:12,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:12,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774146431] [2019-12-27 08:17:12,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:12,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774146431] [2019-12-27 08:17:12,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:12,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:17:12,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366188268] [2019-12-27 08:17:12,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:17:12,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:17:12,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:17:12,295 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2019-12-27 08:17:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:12,502 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2019-12-27 08:17:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:17:12,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-27 08:17:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:12,506 INFO L225 Difference]: With dead ends: 599 [2019-12-27 08:17:12,506 INFO L226 Difference]: Without dead ends: 514 [2019-12-27 08:17:12,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:17:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-27 08:17:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2019-12-27 08:17:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-27 08:17:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2019-12-27 08:17:12,524 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2019-12-27 08:17:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:12,524 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2019-12-27 08:17:12,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:17:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2019-12-27 08:17:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 08:17:12,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:12,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:12,526 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1452138275, now seen corresponding path program 1 times [2019-12-27 08:17:12,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:12,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34616566] [2019-12-27 08:17:12,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:12,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34616566] [2019-12-27 08:17:12,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:12,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:17:12,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931917433] [2019-12-27 08:17:12,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:17:12,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:12,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:17:12,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:17:12,590 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2019-12-27 08:17:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:12,606 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2019-12-27 08:17:12,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:17:12,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 08:17:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:12,608 INFO L225 Difference]: With dead ends: 162 [2019-12-27 08:17:12,608 INFO L226 Difference]: Without dead ends: 162 [2019-12-27 08:17:12,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:17:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-27 08:17:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-27 08:17:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 08:17:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2019-12-27 08:17:12,613 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2019-12-27 08:17:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:12,614 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2019-12-27 08:17:12,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:17:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2019-12-27 08:17:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:12,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:12,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:12,617 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2124244464, now seen corresponding path program 1 times [2019-12-27 08:17:12,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:12,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717477157] [2019-12-27 08:17:12,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:12,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717477157] [2019-12-27 08:17:12,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:12,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:17:12,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044738513] [2019-12-27 08:17:12,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:17:12,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:17:12,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:17:12,947 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2019-12-27 08:17:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:13,183 INFO L93 Difference]: Finished difference Result 186 states and 379 transitions. [2019-12-27 08:17:13,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:17:13,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:17:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:13,188 INFO L225 Difference]: With dead ends: 186 [2019-12-27 08:17:13,188 INFO L226 Difference]: Without dead ends: 186 [2019-12-27 08:17:13,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:17:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-27 08:17:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2019-12-27 08:17:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 08:17:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 335 transitions. [2019-12-27 08:17:13,197 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 335 transitions. Word has length 22 [2019-12-27 08:17:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:13,197 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 335 transitions. [2019-12-27 08:17:13,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:17:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 335 transitions. [2019-12-27 08:17:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:13,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:13,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:13,207 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash 732163342, now seen corresponding path program 1 times [2019-12-27 08:17:13,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:13,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792125145] [2019-12-27 08:17:13,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:13,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792125145] [2019-12-27 08:17:13,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:13,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:17:13,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928366190] [2019-12-27 08:17:13,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:17:13,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:13,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:17:13,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:17:13,384 INFO L87 Difference]: Start difference. First operand 162 states and 335 transitions. Second operand 5 states. [2019-12-27 08:17:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:13,603 INFO L93 Difference]: Finished difference Result 206 states and 412 transitions. [2019-12-27 08:17:13,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:17:13,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 08:17:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:13,605 INFO L225 Difference]: With dead ends: 206 [2019-12-27 08:17:13,606 INFO L226 Difference]: Without dead ends: 206 [2019-12-27 08:17:13,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:17:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-27 08:17:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2019-12-27 08:17:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-27 08:17:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 390 transitions. [2019-12-27 08:17:13,612 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 390 transitions. Word has length 22 [2019-12-27 08:17:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:13,612 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 390 transitions. [2019-12-27 08:17:13,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:17:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 390 transitions. [2019-12-27 08:17:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:13,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:13,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:13,614 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash -55183662, now seen corresponding path program 2 times [2019-12-27 08:17:13,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:13,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166541989] [2019-12-27 08:17:13,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:14,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166541989] [2019-12-27 08:17:14,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:14,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:14,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4442644] [2019-12-27 08:17:14,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:14,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:14,768 INFO L87 Difference]: Start difference. First operand 194 states and 390 transitions. Second operand 16 states. [2019-12-27 08:17:15,250 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-12-27 08:17:15,545 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-12-27 08:17:15,859 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-27 08:17:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:16,926 INFO L93 Difference]: Finished difference Result 301 states and 558 transitions. [2019-12-27 08:17:16,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:17:16,927 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:16,930 INFO L225 Difference]: With dead ends: 301 [2019-12-27 08:17:16,930 INFO L226 Difference]: Without dead ends: 301 [2019-12-27 08:17:16,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:17:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-27 08:17:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 235. [2019-12-27 08:17:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-27 08:17:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 447 transitions. [2019-12-27 08:17:16,939 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 447 transitions. Word has length 22 [2019-12-27 08:17:16,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:16,939 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 447 transitions. [2019-12-27 08:17:16,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 447 transitions. [2019-12-27 08:17:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:16,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:16,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:16,941 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash -55183677, now seen corresponding path program 1 times [2019-12-27 08:17:16,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:16,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865357826] [2019-12-27 08:17:16,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:17,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865357826] [2019-12-27 08:17:17,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:17,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:17:17,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999123014] [2019-12-27 08:17:17,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:17,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:17,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:17,235 INFO L87 Difference]: Start difference. First operand 235 states and 447 transitions. Second operand 9 states. [2019-12-27 08:17:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:17,792 INFO L93 Difference]: Finished difference Result 321 states and 587 transitions. [2019-12-27 08:17:17,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:17:17,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 08:17:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:17,797 INFO L225 Difference]: With dead ends: 321 [2019-12-27 08:17:17,797 INFO L226 Difference]: Without dead ends: 279 [2019-12-27 08:17:17,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:17:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-27 08:17:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 235. [2019-12-27 08:17:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-27 08:17:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 453 transitions. [2019-12-27 08:17:17,807 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 453 transitions. Word has length 22 [2019-12-27 08:17:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:17,808 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 453 transitions. [2019-12-27 08:17:17,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 453 transitions. [2019-12-27 08:17:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:17,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:17,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:17,809 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:17,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1284449614, now seen corresponding path program 2 times [2019-12-27 08:17:17,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:17,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861862608] [2019-12-27 08:17:17,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:18,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861862608] [2019-12-27 08:17:18,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:18,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:17:18,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200468477] [2019-12-27 08:17:18,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:17:18,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:17:18,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:17:18,036 INFO L87 Difference]: Start difference. First operand 235 states and 453 transitions. Second operand 6 states. [2019-12-27 08:17:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:18,508 INFO L93 Difference]: Finished difference Result 242 states and 463 transitions. [2019-12-27 08:17:18,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:17:18,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:17:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:18,511 INFO L225 Difference]: With dead ends: 242 [2019-12-27 08:17:18,511 INFO L226 Difference]: Without dead ends: 242 [2019-12-27 08:17:18,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:17:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-27 08:17:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2019-12-27 08:17:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-27 08:17:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 398 transitions. [2019-12-27 08:17:18,517 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 398 transitions. Word has length 22 [2019-12-27 08:17:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:18,518 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 398 transitions. [2019-12-27 08:17:18,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:17:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 398 transitions. [2019-12-27 08:17:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:18,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:18,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:18,519 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash 497102610, now seen corresponding path program 3 times [2019-12-27 08:17:18,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:18,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883170157] [2019-12-27 08:17:18,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:18,782 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-12-27 08:17:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:19,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883170157] [2019-12-27 08:17:19,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:19,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:19,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855499781] [2019-12-27 08:17:19,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:19,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:19,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:19,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:19,736 INFO L87 Difference]: Start difference. First operand 202 states and 398 transitions. Second operand 16 states. [2019-12-27 08:17:20,448 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-27 08:17:20,700 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-27 08:17:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:21,819 INFO L93 Difference]: Finished difference Result 308 states and 587 transitions. [2019-12-27 08:17:21,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:17:21,820 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:21,823 INFO L225 Difference]: With dead ends: 308 [2019-12-27 08:17:21,824 INFO L226 Difference]: Without dead ends: 295 [2019-12-27 08:17:21,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:17:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-27 08:17:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 202. [2019-12-27 08:17:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-27 08:17:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 397 transitions. [2019-12-27 08:17:21,832 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 397 transitions. Word has length 22 [2019-12-27 08:17:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:21,833 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 397 transitions. [2019-12-27 08:17:21,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 397 transitions. [2019-12-27 08:17:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:21,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:21,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:21,834 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2050812348, now seen corresponding path program 3 times [2019-12-27 08:17:21,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:21,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226885451] [2019-12-27 08:17:21,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:22,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226885451] [2019-12-27 08:17:22,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:22,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 08:17:22,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655385292] [2019-12-27 08:17:22,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:22,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:22,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:22,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:22,356 INFO L87 Difference]: Start difference. First operand 202 states and 397 transitions. Second operand 9 states. [2019-12-27 08:17:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:23,484 INFO L93 Difference]: Finished difference Result 334 states and 687 transitions. [2019-12-27 08:17:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:17:23,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 08:17:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:23,488 INFO L225 Difference]: With dead ends: 334 [2019-12-27 08:17:23,488 INFO L226 Difference]: Without dead ends: 334 [2019-12-27 08:17:23,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:17:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-12-27 08:17:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 262. [2019-12-27 08:17:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-27 08:17:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 555 transitions. [2019-12-27 08:17:23,495 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 555 transitions. Word has length 22 [2019-12-27 08:17:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:23,496 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 555 transitions. [2019-12-27 08:17:23,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 555 transitions. [2019-12-27 08:17:23,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:23,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:23,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:23,497 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:23,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:23,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211444, now seen corresponding path program 4 times [2019-12-27 08:17:23,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:23,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849031949] [2019-12-27 08:17:23,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:24,055 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-27 08:17:24,228 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-12-27 08:17:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:24,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849031949] [2019-12-27 08:17:24,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:24,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:24,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471142086] [2019-12-27 08:17:24,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:24,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:24,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:24,723 INFO L87 Difference]: Start difference. First operand 262 states and 555 transitions. Second operand 16 states. [2019-12-27 08:17:25,212 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-12-27 08:17:25,548 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-27 08:17:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:26,886 INFO L93 Difference]: Finished difference Result 394 states and 807 transitions. [2019-12-27 08:17:26,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:17:26,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:26,888 INFO L225 Difference]: With dead ends: 394 [2019-12-27 08:17:26,889 INFO L226 Difference]: Without dead ends: 394 [2019-12-27 08:17:26,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:17:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-12-27 08:17:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 276. [2019-12-27 08:17:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-27 08:17:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 575 transitions. [2019-12-27 08:17:26,898 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 575 transitions. Word has length 22 [2019-12-27 08:17:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:26,898 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 575 transitions. [2019-12-27 08:17:26,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 575 transitions. [2019-12-27 08:17:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:26,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:26,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:26,900 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211429, now seen corresponding path program 2 times [2019-12-27 08:17:26,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:26,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117655609] [2019-12-27 08:17:26,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:27,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117655609] [2019-12-27 08:17:27,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:27,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:17:27,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794454109] [2019-12-27 08:17:27,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:27,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:27,174 INFO L87 Difference]: Start difference. First operand 276 states and 575 transitions. Second operand 9 states. [2019-12-27 08:17:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:27,641 INFO L93 Difference]: Finished difference Result 383 states and 769 transitions. [2019-12-27 08:17:27,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:17:27,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 08:17:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:27,644 INFO L225 Difference]: With dead ends: 383 [2019-12-27 08:17:27,645 INFO L226 Difference]: Without dead ends: 375 [2019-12-27 08:17:27,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:17:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-27 08:17:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 320. [2019-12-27 08:17:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 08:17:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 672 transitions. [2019-12-27 08:17:27,653 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 672 transitions. Word has length 22 [2019-12-27 08:17:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:27,653 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 672 transitions. [2019-12-27 08:17:27,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 672 transitions. [2019-12-27 08:17:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:27,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:27,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:27,655 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1515700702, now seen corresponding path program 5 times [2019-12-27 08:17:27,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:27,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426569855] [2019-12-27 08:17:27,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:28,188 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-27 08:17:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:28,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426569855] [2019-12-27 08:17:28,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:28,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:28,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142185208] [2019-12-27 08:17:28,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:28,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:28,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:28,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:28,697 INFO L87 Difference]: Start difference. First operand 320 states and 672 transitions. Second operand 16 states. [2019-12-27 08:17:29,443 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-27 08:17:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:30,538 INFO L93 Difference]: Finished difference Result 444 states and 910 transitions. [2019-12-27 08:17:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:17:30,538 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:30,542 INFO L225 Difference]: With dead ends: 444 [2019-12-27 08:17:30,542 INFO L226 Difference]: Without dead ends: 431 [2019-12-27 08:17:30,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:17:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-27 08:17:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 318. [2019-12-27 08:17:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-27 08:17:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 667 transitions. [2019-12-27 08:17:30,551 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 667 transitions. Word has length 22 [2019-12-27 08:17:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:30,552 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 667 transitions. [2019-12-27 08:17:30,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 667 transitions. [2019-12-27 08:17:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:30,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:30,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:30,553 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069572, now seen corresponding path program 6 times [2019-12-27 08:17:30,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:30,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677804379] [2019-12-27 08:17:30,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:31,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677804379] [2019-12-27 08:17:31,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:31,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:31,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700941351] [2019-12-27 08:17:31,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:31,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:31,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:31,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:31,539 INFO L87 Difference]: Start difference. First operand 318 states and 667 transitions. Second operand 16 states. [2019-12-27 08:17:31,968 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-12-27 08:17:32,264 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-27 08:17:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:33,402 INFO L93 Difference]: Finished difference Result 442 states and 902 transitions. [2019-12-27 08:17:33,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:17:33,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:33,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:33,405 INFO L225 Difference]: With dead ends: 442 [2019-12-27 08:17:33,406 INFO L226 Difference]: Without dead ends: 431 [2019-12-27 08:17:33,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:17:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-27 08:17:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 326. [2019-12-27 08:17:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-12-27 08:17:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 673 transitions. [2019-12-27 08:17:33,414 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 673 transitions. Word has length 22 [2019-12-27 08:17:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:33,415 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 673 transitions. [2019-12-27 08:17:33,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:33,415 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 673 transitions. [2019-12-27 08:17:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:33,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:33,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:33,416 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:33,417 INFO L82 PathProgramCache]: Analyzing trace with hash 718214449, now seen corresponding path program 3 times [2019-12-27 08:17:33,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:33,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399890678] [2019-12-27 08:17:33,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:33,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399890678] [2019-12-27 08:17:33,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:33,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:17:33,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052313043] [2019-12-27 08:17:33,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:33,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:33,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:33,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:33,727 INFO L87 Difference]: Start difference. First operand 326 states and 673 transitions. Second operand 9 states. [2019-12-27 08:17:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:34,218 INFO L93 Difference]: Finished difference Result 404 states and 791 transitions. [2019-12-27 08:17:34,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:17:34,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 08:17:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:34,221 INFO L225 Difference]: With dead ends: 404 [2019-12-27 08:17:34,221 INFO L226 Difference]: Without dead ends: 392 [2019-12-27 08:17:34,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:17:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-12-27 08:17:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 308. [2019-12-27 08:17:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-27 08:17:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 648 transitions. [2019-12-27 08:17:34,229 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 648 transitions. Word has length 22 [2019-12-27 08:17:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:34,229 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 648 transitions. [2019-12-27 08:17:34,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 648 transitions. [2019-12-27 08:17:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:34,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:34,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:34,231 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:34,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:34,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1341843718, now seen corresponding path program 7 times [2019-12-27 08:17:34,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:34,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250573938] [2019-12-27 08:17:34,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:34,960 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-12-27 08:17:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:35,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250573938] [2019-12-27 08:17:35,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:35,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:35,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077386936] [2019-12-27 08:17:35,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:35,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:35,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:35,424 INFO L87 Difference]: Start difference. First operand 308 states and 648 transitions. Second operand 16 states. [2019-12-27 08:17:36,132 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-27 08:17:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:37,520 INFO L93 Difference]: Finished difference Result 465 states and 939 transitions. [2019-12-27 08:17:37,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:17:37,520 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:37,524 INFO L225 Difference]: With dead ends: 465 [2019-12-27 08:17:37,524 INFO L226 Difference]: Without dead ends: 443 [2019-12-27 08:17:37,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:17:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-12-27 08:17:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 298. [2019-12-27 08:17:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-27 08:17:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 631 transitions. [2019-12-27 08:17:37,533 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 631 transitions. Word has length 22 [2019-12-27 08:17:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:37,533 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 631 transitions. [2019-12-27 08:17:37,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 631 transitions. [2019-12-27 08:17:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:37,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:37,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:37,535 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:37,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:37,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1650245952, now seen corresponding path program 8 times [2019-12-27 08:17:37,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:37,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157421979] [2019-12-27 08:17:37,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:37,799 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-12-27 08:17:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:37,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157421979] [2019-12-27 08:17:37,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:37,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:17:37,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38282225] [2019-12-27 08:17:37,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:17:37,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:37,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:17:37,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:17:37,807 INFO L87 Difference]: Start difference. First operand 298 states and 631 transitions. Second operand 6 states. [2019-12-27 08:17:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:38,031 INFO L93 Difference]: Finished difference Result 250 states and 483 transitions. [2019-12-27 08:17:38,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:17:38,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:17:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:38,033 INFO L225 Difference]: With dead ends: 250 [2019-12-27 08:17:38,033 INFO L226 Difference]: Without dead ends: 250 [2019-12-27 08:17:38,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:17:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-27 08:17:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2019-12-27 08:17:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-27 08:17:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 479 transitions. [2019-12-27 08:17:38,039 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 479 transitions. Word has length 22 [2019-12-27 08:17:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:38,039 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 479 transitions. [2019-12-27 08:17:38,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:17:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 479 transitions. [2019-12-27 08:17:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:38,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:38,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:38,040 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash -936962176, now seen corresponding path program 9 times [2019-12-27 08:17:38,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:38,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536675374] [2019-12-27 08:17:38,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:39,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536675374] [2019-12-27 08:17:39,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:39,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:39,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588338234] [2019-12-27 08:17:39,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:39,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:39,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:39,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:39,218 INFO L87 Difference]: Start difference. First operand 246 states and 479 transitions. Second operand 16 states. [2019-12-27 08:17:39,899 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:17:40,187 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-12-27 08:17:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:40,845 INFO L93 Difference]: Finished difference Result 275 states and 522 transitions. [2019-12-27 08:17:40,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:17:40,845 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:40,847 INFO L225 Difference]: With dead ends: 275 [2019-12-27 08:17:40,847 INFO L226 Difference]: Without dead ends: 275 [2019-12-27 08:17:40,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:17:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-27 08:17:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-12-27 08:17:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-27 08:17:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 522 transitions. [2019-12-27 08:17:40,858 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 522 transitions. Word has length 22 [2019-12-27 08:17:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:40,858 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 522 transitions. [2019-12-27 08:17:40,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 522 transitions. [2019-12-27 08:17:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:40,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:40,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:40,860 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:40,860 INFO L82 PathProgramCache]: Analyzing trace with hash -936962191, now seen corresponding path program 4 times [2019-12-27 08:17:40,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:40,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089817214] [2019-12-27 08:17:40,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:41,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089817214] [2019-12-27 08:17:41,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:41,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:17:41,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181958307] [2019-12-27 08:17:41,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:41,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:41,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:41,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:41,204 INFO L87 Difference]: Start difference. First operand 274 states and 522 transitions. Second operand 9 states. [2019-12-27 08:17:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:41,805 INFO L93 Difference]: Finished difference Result 400 states and 730 transitions. [2019-12-27 08:17:41,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:17:41,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 08:17:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:41,807 INFO L225 Difference]: With dead ends: 400 [2019-12-27 08:17:41,807 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 08:17:41,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:17:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 08:17:41,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 272. [2019-12-27 08:17:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-12-27 08:17:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 527 transitions. [2019-12-27 08:17:41,814 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 527 transitions. Word has length 22 [2019-12-27 08:17:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:41,814 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 527 transitions. [2019-12-27 08:17:41,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 527 transitions. [2019-12-27 08:17:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:41,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:41,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:41,816 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash 590296588, now seen corresponding path program 10 times [2019-12-27 08:17:41,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:41,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364553890] [2019-12-27 08:17:41,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17: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. [2019-12-27 08:17:43,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364553890] [2019-12-27 08:17:43,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:43,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:43,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435783430] [2019-12-27 08:17:43,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:43,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:43,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:43,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:43,344 INFO L87 Difference]: Start difference. First operand 272 states and 527 transitions. Second operand 16 states. [2019-12-27 08:17:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:44,968 INFO L93 Difference]: Finished difference Result 307 states and 584 transitions. [2019-12-27 08:17:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:17:44,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:44,970 INFO L225 Difference]: With dead ends: 307 [2019-12-27 08:17:44,971 INFO L226 Difference]: Without dead ends: 307 [2019-12-27 08:17:44,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:17:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-27 08:17:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2019-12-27 08:17:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-27 08:17:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 561 transitions. [2019-12-27 08:17:44,977 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 561 transitions. Word has length 22 [2019-12-27 08:17:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:44,978 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 561 transitions. [2019-12-27 08:17:44,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 561 transitions. [2019-12-27 08:17:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:44,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:44,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:44,980 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash 590296573, now seen corresponding path program 5 times [2019-12-27 08:17:44,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:44,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539381225] [2019-12-27 08:17:44,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:45,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539381225] [2019-12-27 08:17:45,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:45,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:17:45,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215470813] [2019-12-27 08:17:45,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:45,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:45,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:45,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:45,343 INFO L87 Difference]: Start difference. First operand 294 states and 561 transitions. Second operand 9 states. [2019-12-27 08:17:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:46,049 INFO L93 Difference]: Finished difference Result 451 states and 819 transitions. [2019-12-27 08:17:46,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:17:46,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 08:17:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:46,052 INFO L225 Difference]: With dead ends: 451 [2019-12-27 08:17:46,052 INFO L226 Difference]: Without dead ends: 429 [2019-12-27 08:17:46,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:17:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-27 08:17:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 268. [2019-12-27 08:17:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-12-27 08:17:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 522 transitions. [2019-12-27 08:17:46,059 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 522 transitions. Word has length 22 [2019-12-27 08:17:46,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:46,059 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 522 transitions. [2019-12-27 08:17:46,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 522 transitions. [2019-12-27 08:17:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:46,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:46,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:46,060 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:46,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1516658228, now seen corresponding path program 11 times [2019-12-27 08:17:46,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:46,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376606822] [2019-12-27 08:17:46,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:46,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376606822] [2019-12-27 08:17:46,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:46,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:46,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220214676] [2019-12-27 08:17:46,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:46,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:46,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:46,887 INFO L87 Difference]: Start difference. First operand 268 states and 522 transitions. Second operand 16 states. [2019-12-27 08:17:47,596 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:17:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:48,583 INFO L93 Difference]: Finished difference Result 303 states and 575 transitions. [2019-12-27 08:17:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:17:48,583 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:48,585 INFO L225 Difference]: With dead ends: 303 [2019-12-27 08:17:48,585 INFO L226 Difference]: Without dead ends: 289 [2019-12-27 08:17:48,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:17:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-27 08:17:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 268. [2019-12-27 08:17:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-12-27 08:17:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 520 transitions. [2019-12-27 08:17:48,591 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 520 transitions. Word has length 22 [2019-12-27 08:17:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:48,591 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 520 transitions. [2019-12-27 08:17:48,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 520 transitions. [2019-12-27 08:17:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:48,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:48,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:48,593 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:48,593 INFO L82 PathProgramCache]: Analyzing trace with hash -835410036, now seen corresponding path program 12 times [2019-12-27 08:17:48,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:48,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715142547] [2019-12-27 08:17:48,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:49,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715142547] [2019-12-27 08:17:49,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:49,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:49,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302632542] [2019-12-27 08:17:49,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:49,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:49,706 INFO L87 Difference]: Start difference. First operand 268 states and 520 transitions. Second operand 16 states. [2019-12-27 08:17:50,421 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-12-27 08:17:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:51,286 INFO L93 Difference]: Finished difference Result 295 states and 559 transitions. [2019-12-27 08:17:51,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:17:51,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:51,288 INFO L225 Difference]: With dead ends: 295 [2019-12-27 08:17:51,288 INFO L226 Difference]: Without dead ends: 279 [2019-12-27 08:17:51,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:17:51,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-27 08:17:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-12-27 08:17:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-12-27 08:17:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 504 transitions. [2019-12-27 08:17:51,293 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 504 transitions. Word has length 22 [2019-12-27 08:17:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:51,294 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 504 transitions. [2019-12-27 08:17:51,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 504 transitions. [2019-12-27 08:17:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:51,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:51,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:51,295 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:51,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1201713386, now seen corresponding path program 13 times [2019-12-27 08:17:51,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:51,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749141733] [2019-12-27 08:17:51,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:51,592 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-27 08:17:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:52,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749141733] [2019-12-27 08:17:52,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:52,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:52,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154675013] [2019-12-27 08:17:52,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:52,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:52,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:52,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:52,601 INFO L87 Difference]: Start difference. First operand 258 states and 504 transitions. Second operand 16 states. [2019-12-27 08:17:53,279 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:17:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:54,194 INFO L93 Difference]: Finished difference Result 293 states and 561 transitions. [2019-12-27 08:17:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:17:54,194 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:54,196 INFO L225 Difference]: With dead ends: 293 [2019-12-27 08:17:54,196 INFO L226 Difference]: Without dead ends: 260 [2019-12-27 08:17:54,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:17:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-27 08:17:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2019-12-27 08:17:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-27 08:17:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 493 transitions. [2019-12-27 08:17:54,202 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 493 transitions. Word has length 22 [2019-12-27 08:17:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:54,203 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 493 transitions. [2019-12-27 08:17:54,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 493 transitions. [2019-12-27 08:17:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:54,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:54,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:54,204 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:54,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:54,204 INFO L82 PathProgramCache]: Analyzing trace with hash 563733022, now seen corresponding path program 14 times [2019-12-27 08:17:54,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:54,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480920161] [2019-12-27 08:17:54,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:54,454 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-27 08:17:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:55,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480920161] [2019-12-27 08:17:55,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:55,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:55,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148114264] [2019-12-27 08:17:55,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:55,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:55,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:55,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:55,458 INFO L87 Difference]: Start difference. First operand 252 states and 493 transitions. Second operand 16 states. [2019-12-27 08:17:55,906 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-12-27 08:17:56,172 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-12-27 08:17:56,395 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-12-27 08:17:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:57,036 INFO L93 Difference]: Finished difference Result 282 states and 537 transitions. [2019-12-27 08:17:57,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:17:57,037 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:17:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:57,039 INFO L225 Difference]: With dead ends: 282 [2019-12-27 08:17:57,039 INFO L226 Difference]: Without dead ends: 248 [2019-12-27 08:17:57,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:17:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-27 08:17:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-12-27 08:17:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-27 08:17:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 485 transitions. [2019-12-27 08:17:57,045 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 485 transitions. Word has length 22 [2019-12-27 08:17:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:57,045 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 485 transitions. [2019-12-27 08:17:57,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:17:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 485 transitions. [2019-12-27 08:17:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:17:57,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:57,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:57,046 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash -778198608, now seen corresponding path program 15 times [2019-12-27 08:17:57,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:57,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179918624] [2019-12-27 08:17:57,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:58,012 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-12-27 08:17:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:17:58,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179918624] [2019-12-27 08:17:58,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:58,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:17:58,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030438386] [2019-12-27 08:17:58,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:17:58,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:17:58,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:17:58,420 INFO L87 Difference]: Start difference. First operand 248 states and 485 transitions. Second operand 16 states. [2019-12-27 08:17:59,065 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-12-27 08:17:59,343 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-27 08:18:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:00,261 INFO L93 Difference]: Finished difference Result 300 states and 563 transitions. [2019-12-27 08:18:00,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:18:00,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:00,263 INFO L225 Difference]: With dead ends: 300 [2019-12-27 08:18:00,263 INFO L226 Difference]: Without dead ends: 285 [2019-12-27 08:18:00,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-27 08:18:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 243. [2019-12-27 08:18:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-27 08:18:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 479 transitions. [2019-12-27 08:18:00,268 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 479 transitions. Word has length 22 [2019-12-27 08:18:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:00,268 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 479 transitions. [2019-12-27 08:18:00,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 479 transitions. [2019-12-27 08:18:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:00,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:00,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:00,270 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:00,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2127826590, now seen corresponding path program 16 times [2019-12-27 08:18:00,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:00,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305159357] [2019-12-27 08:18:00,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:00,693 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2019-12-27 08:18:00,833 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-12-27 08:18:00,970 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2019-12-27 08:18:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:01,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305159357] [2019-12-27 08:18:01,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:01,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:01,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591410732] [2019-12-27 08:18:01,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:01,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:01,348 INFO L87 Difference]: Start difference. First operand 243 states and 479 transitions. Second operand 16 states. [2019-12-27 08:18:02,064 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-27 08:18:02,339 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-12-27 08:18:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:03,010 INFO L93 Difference]: Finished difference Result 269 states and 519 transitions. [2019-12-27 08:18:03,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:03,011 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:03,013 INFO L225 Difference]: With dead ends: 269 [2019-12-27 08:18:03,013 INFO L226 Difference]: Without dead ends: 236 [2019-12-27 08:18:03,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-12-27 08:18:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-12-27 08:18:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-27 08:18:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 471 transitions. [2019-12-27 08:18:03,017 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 471 transitions. Word has length 22 [2019-12-27 08:18:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:03,018 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 471 transitions. [2019-12-27 08:18:03,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 471 transitions. [2019-12-27 08:18:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:03,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:03,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:03,019 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:03,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1866831716, now seen corresponding path program 17 times [2019-12-27 08:18:03,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:03,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250547882] [2019-12-27 08:18:03,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:03,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250547882] [2019-12-27 08:18:03,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:03,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:18:03,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791634901] [2019-12-27 08:18:03,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:18:03,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:03,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:18:03,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:18:03,247 INFO L87 Difference]: Start difference. First operand 236 states and 471 transitions. Second operand 6 states. [2019-12-27 08:18:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:03,454 INFO L93 Difference]: Finished difference Result 77 states and 124 transitions. [2019-12-27 08:18:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:18:03,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:18:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:03,455 INFO L225 Difference]: With dead ends: 77 [2019-12-27 08:18:03,455 INFO L226 Difference]: Without dead ends: 77 [2019-12-27 08:18:03,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:18:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-27 08:18:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-12-27 08:18:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-27 08:18:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2019-12-27 08:18:03,459 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 124 transitions. Word has length 22 [2019-12-27 08:18:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:03,459 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 124 transitions. [2019-12-27 08:18:03,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:18:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 124 transitions. [2019-12-27 08:18:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:03,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:03,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:03,460 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash -720376412, now seen corresponding path program 18 times [2019-12-27 08:18:03,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:03,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638276771] [2019-12-27 08:18:03,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:04,188 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-12-27 08:18:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:04,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638276771] [2019-12-27 08:18:04,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:04,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:04,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513649871] [2019-12-27 08:18:04,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:04,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:04,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:04,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:04,602 INFO L87 Difference]: Start difference. First operand 77 states and 124 transitions. Second operand 16 states. [2019-12-27 08:18:05,198 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:18:05,429 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-12-27 08:18:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:06,098 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2019-12-27 08:18:06,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:06,098 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:06,099 INFO L225 Difference]: With dead ends: 111 [2019-12-27 08:18:06,099 INFO L226 Difference]: Without dead ends: 80 [2019-12-27 08:18:06,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-27 08:18:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-12-27 08:18:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-27 08:18:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 127 transitions. [2019-12-27 08:18:06,102 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 127 transitions. Word has length 22 [2019-12-27 08:18:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:06,103 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 127 transitions. [2019-12-27 08:18:06,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 127 transitions. [2019-12-27 08:18:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:06,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:06,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:06,104 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash 806882352, now seen corresponding path program 19 times [2019-12-27 08:18:06,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:06,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715812693] [2019-12-27 08:18:06,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:07,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715812693] [2019-12-27 08:18:07,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:07,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:07,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379176151] [2019-12-27 08:18:07,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:07,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:07,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:07,200 INFO L87 Difference]: Start difference. First operand 79 states and 127 transitions. Second operand 16 states. [2019-12-27 08:18:07,816 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:18:08,465 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-12-27 08:18:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:08,732 INFO L93 Difference]: Finished difference Result 128 states and 209 transitions. [2019-12-27 08:18:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:08,733 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:08,733 INFO L225 Difference]: With dead ends: 128 [2019-12-27 08:18:08,734 INFO L226 Difference]: Without dead ends: 103 [2019-12-27 08:18:08,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-27 08:18:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2019-12-27 08:18:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-27 08:18:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2019-12-27 08:18:08,737 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 22 [2019-12-27 08:18:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:08,737 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2019-12-27 08:18:08,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2019-12-27 08:18:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:08,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:08,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:08,738 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:08,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1300072464, now seen corresponding path program 20 times [2019-12-27 08:18:08,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:08,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673964952] [2019-12-27 08:18:08,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:09,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673964952] [2019-12-27 08:18:09,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:09,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:09,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889863111] [2019-12-27 08:18:09,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:09,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:09,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:09,697 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand 16 states. [2019-12-27 08:18:10,305 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:18:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:11,227 INFO L93 Difference]: Finished difference Result 134 states and 212 transitions. [2019-12-27 08:18:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:18:11,227 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:11,228 INFO L225 Difference]: With dead ends: 134 [2019-12-27 08:18:11,228 INFO L226 Difference]: Without dead ends: 117 [2019-12-27 08:18:11,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:18:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-27 08:18:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 91. [2019-12-27 08:18:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-27 08:18:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 147 transitions. [2019-12-27 08:18:11,230 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 147 transitions. Word has length 22 [2019-12-27 08:18:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:11,231 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 147 transitions. [2019-12-27 08:18:11,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 147 transitions. [2019-12-27 08:18:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:11,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:11,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:11,231 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash -618824272, now seen corresponding path program 21 times [2019-12-27 08:18:11,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:11,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267797887] [2019-12-27 08:18:11,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:12,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267797887] [2019-12-27 08:18:12,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:12,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:12,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352559011] [2019-12-27 08:18:12,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:12,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:12,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:12,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:12,164 INFO L87 Difference]: Start difference. First operand 91 states and 147 transitions. Second operand 16 states. [2019-12-27 08:18:12,754 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 08:18:13,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:13,560 INFO L93 Difference]: Finished difference Result 126 states and 196 transitions. [2019-12-27 08:18:13,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:18:13,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:13,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:13,561 INFO L225 Difference]: With dead ends: 126 [2019-12-27 08:18:13,561 INFO L226 Difference]: Without dead ends: 107 [2019-12-27 08:18:13,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-27 08:18:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2019-12-27 08:18:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-27 08:18:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2019-12-27 08:18:13,563 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 22 [2019-12-27 08:18:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:13,564 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2019-12-27 08:18:13,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2019-12-27 08:18:13,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:13,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:13,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:13,565 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:13,565 INFO L82 PathProgramCache]: Analyzing trace with hash -985127622, now seen corresponding path program 22 times [2019-12-27 08:18:13,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:13,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725470776] [2019-12-27 08:18:13,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:14,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725470776] [2019-12-27 08:18:14,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:14,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:14,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588780508] [2019-12-27 08:18:14,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:14,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:14,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:14,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:14,572 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand 16 states. [2019-12-27 08:18:15,142 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:18:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:15,935 INFO L93 Difference]: Finished difference Result 123 states and 196 transitions. [2019-12-27 08:18:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:15,936 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:15,936 INFO L225 Difference]: With dead ends: 123 [2019-12-27 08:18:15,936 INFO L226 Difference]: Without dead ends: 87 [2019-12-27 08:18:15,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-27 08:18:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-12-27 08:18:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-27 08:18:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2019-12-27 08:18:15,939 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 22 [2019-12-27 08:18:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:15,939 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2019-12-27 08:18:15,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2019-12-27 08:18:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:15,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:15,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:15,940 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash 780318786, now seen corresponding path program 23 times [2019-12-27 08:18:15,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:15,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991399688] [2019-12-27 08:18:15,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:17,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991399688] [2019-12-27 08:18:17,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:17,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:17,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176739362] [2019-12-27 08:18:17,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:17,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:17,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:17,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:17,107 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand 16 states. [2019-12-27 08:18:17,729 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-12-27 08:18:17,947 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-12-27 08:18:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:18,641 INFO L93 Difference]: Finished difference Result 108 states and 168 transitions. [2019-12-27 08:18:18,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:18,641 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:18,642 INFO L225 Difference]: With dead ends: 108 [2019-12-27 08:18:18,643 INFO L226 Difference]: Without dead ends: 62 [2019-12-27 08:18:18,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-27 08:18:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-27 08:18:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-27 08:18:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2019-12-27 08:18:18,645 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 22 [2019-12-27 08:18:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:18,646 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2019-12-27 08:18:18,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2019-12-27 08:18:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:18,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:18,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:18,647 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash 799080048, now seen corresponding path program 24 times [2019-12-27 08:18:18,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:18,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279536126] [2019-12-27 08:18:18,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:19,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279536126] [2019-12-27 08:18:19,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:19,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:19,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779700586] [2019-12-27 08:18:19,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:19,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:19,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:19,775 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand 16 states. [2019-12-27 08:18:20,352 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:18:20,546 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-12-27 08:18:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:21,219 INFO L93 Difference]: Finished difference Result 92 states and 143 transitions. [2019-12-27 08:18:21,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:21,220 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:21,221 INFO L225 Difference]: With dead ends: 92 [2019-12-27 08:18:21,221 INFO L226 Difference]: Without dead ends: 61 [2019-12-27 08:18:21,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-27 08:18:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-27 08:18:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-27 08:18:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2019-12-27 08:18:21,223 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 22 [2019-12-27 08:18:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:21,223 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 96 transitions. [2019-12-27 08:18:21,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2019-12-27 08:18:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:21,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:21,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:21,224 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1968628484, now seen corresponding path program 25 times [2019-12-27 08:18:21,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:21,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458374685] [2019-12-27 08:18:21,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:22,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458374685] [2019-12-27 08:18:22,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:22,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:22,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363280280] [2019-12-27 08:18:22,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:22,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:22,237 INFO L87 Difference]: Start difference. First operand 61 states and 96 transitions. Second operand 16 states. [2019-12-27 08:18:22,817 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:18:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:23,657 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2019-12-27 08:18:23,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:23,658 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:23,658 INFO L225 Difference]: With dead ends: 109 [2019-12-27 08:18:23,659 INFO L226 Difference]: Without dead ends: 84 [2019-12-27 08:18:23,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-27 08:18:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2019-12-27 08:18:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-27 08:18:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 110 transitions. [2019-12-27 08:18:23,661 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 110 transitions. Word has length 22 [2019-12-27 08:18:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:23,661 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 110 transitions. [2019-12-27 08:18:23,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 110 transitions. [2019-12-27 08:18:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:23,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:23,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:23,662 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:23,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:23,663 INFO L82 PathProgramCache]: Analyzing trace with hash 219383996, now seen corresponding path program 26 times [2019-12-27 08:18:23,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:23,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585655634] [2019-12-27 08:18:23,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:24,009 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2019-12-27 08:18:24,174 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-12-27 08:18:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:24,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585655634] [2019-12-27 08:18:24,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:24,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:24,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866485216] [2019-12-27 08:18:24,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:24,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:24,830 INFO L87 Difference]: Start difference. First operand 69 states and 110 transitions. Second operand 16 states. [2019-12-27 08:18:25,405 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:18:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:26,302 INFO L93 Difference]: Finished difference Result 115 states and 180 transitions. [2019-12-27 08:18:26,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:18:26,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:26,303 INFO L225 Difference]: With dead ends: 115 [2019-12-27 08:18:26,303 INFO L226 Difference]: Without dead ends: 98 [2019-12-27 08:18:26,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:18:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-27 08:18:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-12-27 08:18:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-27 08:18:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2019-12-27 08:18:26,305 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 22 [2019-12-27 08:18:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:26,305 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2019-12-27 08:18:26,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2019-12-27 08:18:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:26,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:26,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:26,306 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:26,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash 900632188, now seen corresponding path program 27 times [2019-12-27 08:18:26,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:26,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431507597] [2019-12-27 08:18:26,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:27,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431507597] [2019-12-27 08:18:27,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:27,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:27,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162747053] [2019-12-27 08:18:27,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:27,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:27,273 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand 16 states. [2019-12-27 08:18:27,841 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 08:18:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:28,605 INFO L93 Difference]: Finished difference Result 107 states and 164 transitions. [2019-12-27 08:18:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:18:28,606 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:28,607 INFO L225 Difference]: With dead ends: 107 [2019-12-27 08:18:28,607 INFO L226 Difference]: Without dead ends: 88 [2019-12-27 08:18:28,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-27 08:18:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2019-12-27 08:18:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-27 08:18:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 102 transitions. [2019-12-27 08:18:28,611 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 102 transitions. Word has length 22 [2019-12-27 08:18:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:28,611 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 102 transitions. [2019-12-27 08:18:28,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 102 transitions. [2019-12-27 08:18:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:28,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:28,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:28,612 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:28,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:28,612 INFO L82 PathProgramCache]: Analyzing trace with hash 534328838, now seen corresponding path program 28 times [2019-12-27 08:18:28,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:28,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566694617] [2019-12-27 08:18:28,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:29,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566694617] [2019-12-27 08:18:29,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:29,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:29,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309458090] [2019-12-27 08:18:29,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:29,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:29,615 INFO L87 Difference]: Start difference. First operand 65 states and 102 transitions. Second operand 16 states. [2019-12-27 08:18:30,182 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-27 08:18:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:30,998 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2019-12-27 08:18:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:30,998 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:30,999 INFO L225 Difference]: With dead ends: 95 [2019-12-27 08:18:30,999 INFO L226 Difference]: Without dead ends: 59 [2019-12-27 08:18:30,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-27 08:18:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-27 08:18:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-27 08:18:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 92 transitions. [2019-12-27 08:18:31,001 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 92 transitions. Word has length 22 [2019-12-27 08:18:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:31,001 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 92 transitions. [2019-12-27 08:18:31,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 92 transitions. [2019-12-27 08:18:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:31,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:31,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:31,002 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1929190334, now seen corresponding path program 29 times [2019-12-27 08:18:31,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:31,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597909234] [2019-12-27 08:18:31,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:32,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597909234] [2019-12-27 08:18:32,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:32,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:32,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309424885] [2019-12-27 08:18:32,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:32,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:32,046 INFO L87 Difference]: Start difference. First operand 59 states and 92 transitions. Second operand 16 states. [2019-12-27 08:18:33,225 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-27 08:18:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:33,524 INFO L93 Difference]: Finished difference Result 88 states and 136 transitions. [2019-12-27 08:18:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:33,524 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:33,525 INFO L225 Difference]: With dead ends: 88 [2019-12-27 08:18:33,525 INFO L226 Difference]: Without dead ends: 63 [2019-12-27 08:18:33,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-27 08:18:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-12-27 08:18:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-27 08:18:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2019-12-27 08:18:33,527 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 22 [2019-12-27 08:18:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:33,527 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2019-12-27 08:18:33,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2019-12-27 08:18:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:33,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:33,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:33,527 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash -177764482, now seen corresponding path program 30 times [2019-12-27 08:18:33,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:33,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640312088] [2019-12-27 08:18:33,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:34,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640312088] [2019-12-27 08:18:34,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:34,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:34,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466811547] [2019-12-27 08:18:34,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:34,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:34,496 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand 16 states. [2019-12-27 08:18:35,614 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-27 08:18:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:35,983 INFO L93 Difference]: Finished difference Result 85 states and 125 transitions. [2019-12-27 08:18:35,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:18:35,983 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:35,984 INFO L225 Difference]: With dead ends: 85 [2019-12-27 08:18:35,984 INFO L226 Difference]: Without dead ends: 68 [2019-12-27 08:18:35,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:18:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-27 08:18:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-12-27 08:18:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-27 08:18:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2019-12-27 08:18:35,986 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 22 [2019-12-27 08:18:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:35,986 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2019-12-27 08:18:35,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2019-12-27 08:18:35,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:35,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:35,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:35,987 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 503483710, now seen corresponding path program 31 times [2019-12-27 08:18:35,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:35,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005822822] [2019-12-27 08:18:35,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:36,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005822822] [2019-12-27 08:18:36,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:36,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:36,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501868160] [2019-12-27 08:18:36,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:36,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:36,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:36,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:36,958 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand 16 states. [2019-12-27 08:18:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:38,341 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2019-12-27 08:18:38,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:18:38,342 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:38,343 INFO L225 Difference]: With dead ends: 77 [2019-12-27 08:18:38,343 INFO L226 Difference]: Without dead ends: 58 [2019-12-27 08:18:38,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-27 08:18:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-12-27 08:18:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-27 08:18:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2019-12-27 08:18:38,346 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 22 [2019-12-27 08:18:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:38,346 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2019-12-27 08:18:38,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2019-12-27 08:18:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:18:38,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:38,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:38,347 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash -3039712, now seen corresponding path program 32 times [2019-12-27 08:18:38,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:38,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653699565] [2019-12-27 08:18:38,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:18:39,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653699565] [2019-12-27 08:18:39,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:39,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:18:39,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718548571] [2019-12-27 08:18:39,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:18:39,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:39,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:18:39,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:18:39,441 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand 16 states. [2019-12-27 08:18:40,520 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-27 08:18:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:40,725 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2019-12-27 08:18:40,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:40,726 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 08:18:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:40,726 INFO L225 Difference]: With dead ends: 48 [2019-12-27 08:18:40,726 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 08:18:40,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:18:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 08:18:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 08:18:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 08:18:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 08:18:40,728 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-27 08:18:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:40,728 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 08:18:40,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:18:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 08:18:40,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 08:18:40,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:18:40 BasicIcfg [2019-12-27 08:18:40,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:18:40,734 INFO L168 Benchmark]: Toolchain (without parser) took 103830.36 ms. Allocated memory was 137.4 MB in the beginning and 433.6 MB in the end (delta: 296.2 MB). Free memory was 98.8 MB in the beginning and 301.4 MB in the end (delta: -202.6 MB). Peak memory consumption was 93.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:18:40,734 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 08:18:40,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1273.39 ms. Allocated memory was 137.4 MB in the beginning and 233.8 MB in the end (delta: 96.5 MB). Free memory was 98.6 MB in the beginning and 168.9 MB in the end (delta: -70.3 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2019-12-27 08:18:40,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.16 ms. Allocated memory is still 233.8 MB. Free memory was 168.9 MB in the beginning and 165.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:18:40,735 INFO L168 Benchmark]: Boogie Preprocessor took 48.90 ms. Allocated memory is still 233.8 MB. Free memory was 165.9 MB in the beginning and 163.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:18:40,735 INFO L168 Benchmark]: RCFGBuilder took 896.53 ms. Allocated memory is still 233.8 MB. Free memory was 163.0 MB in the beginning and 115.5 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2019-12-27 08:18:40,736 INFO L168 Benchmark]: TraceAbstraction took 101531.09 ms. Allocated memory was 233.8 MB in the beginning and 433.6 MB in the end (delta: 199.8 MB). Free memory was 115.5 MB in the beginning and 301.4 MB in the end (delta: -185.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:18:40,738 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1273.39 ms. Allocated memory was 137.4 MB in the beginning and 233.8 MB in the end (delta: 96.5 MB). Free memory was 98.6 MB in the beginning and 168.9 MB in the end (delta: -70.3 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.16 ms. Allocated memory is still 233.8 MB. Free memory was 168.9 MB in the beginning and 165.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.90 ms. Allocated memory is still 233.8 MB. Free memory was 165.9 MB in the beginning and 163.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 896.53 ms. Allocated memory is still 233.8 MB. Free memory was 163.0 MB in the beginning and 115.5 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101531.09 ms. Allocated memory was 233.8 MB in the beginning and 433.6 MB in the end (delta: 199.8 MB). Free memory was 115.5 MB in the beginning and 301.4 MB in the end (delta: -185.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 11.7s, 151 ProgramPointsBefore, 41 ProgramPointsAfterwards, 155 TransitionsBefore, 41 TransitionsAfterwards, 2884 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 16 ConcurrentYvCompositions, 5 ChoiceCompositions, 1436 VarBasedMoverChecksPositive, 37 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5217 CheckedPairsTotal, 160 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Result: SAFE, OverallTime: 101.3s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 52.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1038 SDtfs, 2073 SDslu, 5080 SDs, 0 SdLazy, 14660 SolverSat, 954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 846 GetRequests, 28 SyntacticMatches, 93 SemanticMatches, 725 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 53.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 1632 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 34.2s InterpolantComputationTime, 901 NumberOfCodeBlocks, 901 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 857 ConstructedInterpolants, 0 QuantifiedInterpolants, 384853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...