/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-McrStrategy.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 15:50:52,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 15:50:52,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 15:50:52,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 15:50:52,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 15:50:52,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 15:50:52,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 15:50:52,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 15:50:52,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 15:50:52,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 15:50:52,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 15:50:52,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 15:50:52,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 15:50:52,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 15:50:52,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 15:50:52,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 15:50:52,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 15:50:52,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 15:50:52,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 15:50:52,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 15:50:52,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 15:50:52,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 15:50:52,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 15:50:52,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 15:50:52,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 15:50:52,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 15:50:52,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 15:50:52,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 15:50:52,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 15:50:52,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 15:50:52,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 15:50:52,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 15:50:52,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 15:50:52,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 15:50:52,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 15:50:52,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 15:50:52,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 15:50:52,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 15:50:52,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 15:50:52,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 15:50:52,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 15:50:52,267 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-McrStrategy.epf [2020-04-18 15:50:52,282 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 15:50:52,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 15:50:52,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 15:50:52,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 15:50:52,284 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 15:50:52,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 15:50:52,285 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 15:50:52,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 15:50:52,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 15:50:52,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 15:50:52,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 15:50:52,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 15:50:52,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 15:50:52,286 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 15:50:52,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 15:50:52,286 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 15:50:52,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 15:50:52,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 15:50:52,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 15:50:52,287 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 15:50:52,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 15:50:52,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 15:50:52,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 15:50:52,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 15:50:52,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 15:50:52,288 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 15:50:52,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 15:50:52,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-04-18 15:50:52,289 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 15:50:52,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 15:50:52,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 15:50:52,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 15:50:52,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 15:50:52,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 15:50:52,623 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 15:50:52,624 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 15:50:52,626 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-04-18 15:50:52,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d732863c/950a4dce2d674db7b3d69482146920d6/FLAGbb38b2617 [2020-04-18 15:50:53,365 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 15:50:53,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-04-18 15:50:53,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d732863c/950a4dce2d674db7b3d69482146920d6/FLAGbb38b2617 [2020-04-18 15:50:53,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d732863c/950a4dce2d674db7b3d69482146920d6 [2020-04-18 15:50:53,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 15:50:53,620 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 15:50:53,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 15:50:53,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 15:50:53,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 15:50:53,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:50:53" (1/1) ... [2020-04-18 15:50:53,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f085492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:53, skipping insertion in model container [2020-04-18 15:50:53,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:50:53" (1/1) ... [2020-04-18 15:50:53,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 15:50:53,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 15:50:54,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 15:50:54,564 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 15:50:54,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 15:50:55,099 INFO L208 MainTranslator]: Completed translation [2020-04-18 15:50:55,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55 WrapperNode [2020-04-18 15:50:55,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 15:50:55,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 15:50:55,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 15:50:55,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 15:50:55,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... [2020-04-18 15:50:55,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... [2020-04-18 15:50:55,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 15:50:55,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 15:50:55,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 15:50:55,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 15:50:55,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... [2020-04-18 15:50:55,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... [2020-04-18 15:50:55,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... [2020-04-18 15:50:55,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... [2020-04-18 15:50:55,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... [2020-04-18 15:50:55,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... [2020-04-18 15:50:55,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... [2020-04-18 15:50:55,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 15:50:55,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 15:50:55,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 15:50:55,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 15:50:55,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 15:50:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 15:50:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-18 15:50:55,325 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-04-18 15:50:55,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-04-18 15:50:55,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 15:50:55,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 15:50:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-04-18 15:50:55,327 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-04-18 15:50:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 15:50:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 15:50:55,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-18 15:50:55,331 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 15:50:56,151 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 15:50:56,152 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-04-18 15:50:56,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:50:56 BoogieIcfgContainer [2020-04-18 15:50:56,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 15:50:56,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 15:50:56,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 15:50:56,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 15:50:56,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:50:53" (1/3) ... [2020-04-18 15:50:56,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cb5b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:50:56, skipping insertion in model container [2020-04-18 15:50:56,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:50:55" (2/3) ... [2020-04-18 15:50:56,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cb5b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:50:56, skipping insertion in model container [2020-04-18 15:50:56,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:50:56" (3/3) ... [2020-04-18 15:50:56,166 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-04-18 15:50:56,176 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 15:50:56,177 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 15:50:56,184 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-04-18 15:50:56,186 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 15:50:56,216 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,216 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,217 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,217 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,217 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,217 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,217 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,218 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,218 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,218 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,218 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,218 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,219 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,219 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,219 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,219 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,220 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,220 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,220 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,220 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,220 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,221 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,221 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,221 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,221 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,222 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,222 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,222 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,222 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,223 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,223 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,223 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,223 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,223 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,224 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,224 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,224 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,224 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,225 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,225 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,225 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,225 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,226 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,226 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,226 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,227 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,227 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,227 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,227 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,228 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,228 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,228 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,228 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,229 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,229 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,229 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,230 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,230 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,234 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,235 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,235 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,235 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,235 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,236 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,236 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,236 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,236 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,237 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,244 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,244 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,245 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,245 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,245 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,245 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,246 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,246 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,246 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,246 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:50:56,278 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-04-18 15:50:56,300 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:50:56,300 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:50:56,300 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:50:56,300 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:50:56,301 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:50:56,301 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:50:56,301 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:50:56,301 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:50:56,321 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions, 330 flow [2020-04-18 15:50:56,323 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-04-18 15:50:56,397 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-04-18 15:50:56,398 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 15:50:56,406 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-04-18 15:50:56,418 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-04-18 15:50:56,463 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-04-18 15:50:56,464 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 15:50:56,467 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-04-18 15:50:56,473 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2652 [2020-04-18 15:50:56,476 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:50:58,314 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:50:58,369 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:50:58,383 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:50:58,408 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:50:58,410 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 15:50:58,410 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2020-04-18 15:51:00,007 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-04-18 15:51:01,151 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:01,193 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:01,202 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:01,227 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:01,228 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:01,229 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-04-18 15:51:02,040 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-04-18 15:51:02,619 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-04-18 15:51:02,791 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-04-18 15:51:03,005 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-04-18 15:51:03,633 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-04-18 15:51:03,760 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-04-18 15:51:04,176 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-04-18 15:51:04,190 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:04,349 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-04-18 15:51:04,350 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:04,357 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-18 15:51:04,567 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-04-18 15:51:04,568 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:04,569 INFO L539 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. [2020-04-18 15:51:04,570 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2020-04-18 15:51:04,740 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-04-18 15:51:04,945 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-04-18 15:51:05,939 WARN L192 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-04-18 15:51:06,357 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-04-18 15:51:06,912 WARN L192 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-04-18 15:51:07,206 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-04-18 15:51:07,221 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5194 [2020-04-18 15:51:07,221 INFO L214 etLargeBlockEncoding]: Total number of compositions: 168 [2020-04-18 15:51:07,224 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2020-04-18 15:51:07,246 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2020-04-18 15:51:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2020-04-18 15:51:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 15:51:07,254 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:07,255 INFO L425 BasicCegarLoop]: trace histogram [1] [2020-04-18 15:51:07,256 INFO L427 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]=== [2020-04-18 15:51:07,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:07,264 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2020-04-18 15:51:07,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:07,272 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [318909736] [2020-04-18 15:51:07,287 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:07,295 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 15:51:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states. [2020-04-18 15:51:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 15:51:07,297 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:07,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 2 times [2020-04-18 15:51:07,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:07,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776453961] [2020-04-18 15:51:07,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:07,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776453961] [2020-04-18 15:51:07,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:07,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-04-18 15:51:07,581 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:07,582 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:07,582 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 15:51:07,582 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:07,585 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:07,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 15:51:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 15:51:07,590 INFO L87 Difference]: Start difference. First operand 2 states. Second operand 2 states. [2020-04-18 15:51:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:07,595 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2020-04-18 15:51:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states and 1 transitions. [2020-04-18 15:51:07,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:07,596 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [318909736] [2020-04-18 15:51:07,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:07,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [0] total 0 [2020-04-18 15:51:07,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [318909736] [2020-04-18 15:51:07,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-18 15:51:07,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:07,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 15:51:07,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 15:51:07,603 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2020-04-18 15:51:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:07,629 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2020-04-18 15:51:07,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-18 15:51:07,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-04-18 15:51:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:07,659 INFO L225 Difference]: With dead ends: 386 [2020-04-18 15:51:07,659 INFO L226 Difference]: Without dead ends: 348 [2020-04-18 15:51:07,661 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 15:51:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-04-18 15:51:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2020-04-18 15:51:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-04-18 15:51:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2020-04-18 15:51:07,747 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2020-04-18 15:51:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:07,747 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2020-04-18 15:51:07,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-18 15:51:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2020-04-18 15:51:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 15:51:07,748 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:07,748 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-04-18 15:51:07,749 INFO L427 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]=== [2020-04-18 15:51:07,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 1 times [2020-04-18 15:51:07,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:07,750 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1275203012] [2020-04-18 15:51:07,750 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:07,750 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 15:51:07,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-04-18 15:51:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 15:51:07,751 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 2 times [2020-04-18 15:51:07,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:07,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981374698] [2020-04-18 15:51:07,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:07,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981374698] [2020-04-18 15:51:07,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:07,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:51:07,958 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:07,959 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:07,961 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 15:51:07,961 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:07,970 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:07,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:07,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:07,971 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2020-04-18 15:51:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:07,979 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2020-04-18 15:51:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 4 transitions. [2020-04-18 15:51:07,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:07,981 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1275203012] [2020-04-18 15:51:07,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:07,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 15:51:07,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1275203012] [2020-04-18 15:51:07,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:51:07,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:07,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:07,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:07,983 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2020-04-18 15:51:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:08,182 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2020-04-18 15:51:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:51:08,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-04-18 15:51:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:08,192 INFO L225 Difference]: With dead ends: 471 [2020-04-18 15:51:08,193 INFO L226 Difference]: Without dead ends: 471 [2020-04-18 15:51:08,194 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-04-18 15:51:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2020-04-18 15:51:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-04-18 15:51:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2020-04-18 15:51:08,251 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2020-04-18 15:51:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:08,252 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2020-04-18 15:51:08,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:51:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2020-04-18 15:51:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 15:51:08,252 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:08,252 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 15:51:08,253 INFO L427 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]=== [2020-04-18 15:51:08,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:08,254 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 1 times [2020-04-18 15:51:08,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:08,254 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1367758616] [2020-04-18 15:51:08,254 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:08,255 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 15:51:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 15:51:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 15:51:08,255 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:08,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:08,256 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 2 times [2020-04-18 15:51:08,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:08,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007906279] [2020-04-18 15:51:08,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:08,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007906279] [2020-04-18 15:51:08,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:08,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:51:08,377 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:08,378 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:08,379 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 15:51:08,379 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:08,390 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:51:08,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:08,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:08,391 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 15:51:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:08,402 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 15:51:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 15:51:08,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:08,403 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1367758616] [2020-04-18 15:51:08,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:08,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 15:51:08,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1367758616] [2020-04-18 15:51:08,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:51:08,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:08,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:51:08,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:08,405 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2020-04-18 15:51:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:08,510 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2020-04-18 15:51:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:51:08,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 15:51:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:08,514 INFO L225 Difference]: With dead ends: 498 [2020-04-18 15:51:08,514 INFO L226 Difference]: Without dead ends: 482 [2020-04-18 15:51:08,515 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:51:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-04-18 15:51:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2020-04-18 15:51:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-04-18 15:51:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2020-04-18 15:51:08,532 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2020-04-18 15:51:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:08,532 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2020-04-18 15:51:08,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:51:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2020-04-18 15:51:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:51:08,534 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:08,534 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:51:08,535 INFO L427 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]=== [2020-04-18 15:51:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 1 times [2020-04-18 15:51:08,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:08,535 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1074860824] [2020-04-18 15:51:08,536 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:08,537 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2020-04-18 15:51:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 15:51:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:51:08,538 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 2 times [2020-04-18 15:51:08,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:08,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654077280] [2020-04-18 15:51:08,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:08,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654077280] [2020-04-18 15:51:08,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:08,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:51:08,617 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:08,618 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:08,620 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 15:51:08,621 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:08,642 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:51:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 15:51:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 15:51:08,643 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 4 states. [2020-04-18 15:51:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:08,681 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-04-18 15:51:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-04-18 15:51:08,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:08,682 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1074860824] [2020-04-18 15:51:08,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:08,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:51:08,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1074860824] [2020-04-18 15:51:08,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 15:51:08,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:08,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 15:51:08,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:51:08,685 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 4 states. [2020-04-18 15:51:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:08,752 INFO L93 Difference]: Finished difference Result 114 states and 195 transitions. [2020-04-18 15:51:08,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-04-18 15:51:08,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-04-18 15:51:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:08,754 INFO L225 Difference]: With dead ends: 114 [2020-04-18 15:51:08,754 INFO L226 Difference]: Without dead ends: 114 [2020-04-18 15:51:08,755 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:51:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-04-18 15:51:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-04-18 15:51:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-04-18 15:51:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 195 transitions. [2020-04-18 15:51:08,758 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 195 transitions. Word has length 10 [2020-04-18 15:51:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:08,759 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 195 transitions. [2020-04-18 15:51:08,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 15:51:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 195 transitions. [2020-04-18 15:51:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:08,760 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:08,760 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:51:08,762 INFO L427 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]=== [2020-04-18 15:51:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 1 times [2020-04-18 15:51:08,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:08,763 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1902830858] [2020-04-18 15:51:08,764 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:08,767 INFO L259 McrAutomatonBuilder]: Finished intersection with 143 states and 312 transitions. [2020-04-18 15:51:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-04-18 15:51:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:08,770 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 2 times [2020-04-18 15:51:08,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:08,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78810561] [2020-04-18 15:51:08,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:08,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78810561] [2020-04-18 15:51:08,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:08,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:51:08,948 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:08,954 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:08,965 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 32 transitions. [2020-04-18 15:51:08,966 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:09,039 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:51:09,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:51:09,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 15:51:09,039 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 6 states. [2020-04-18 15:51:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:09,527 INFO L93 Difference]: Finished difference Result 305 states and 648 transitions. [2020-04-18 15:51:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 648 transitions. [2020-04-18 15:51:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:09,529 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:51:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:09,530 INFO L82 PathProgramCache]: Analyzing trace with hash 721639498, now seen corresponding path program 3 times [2020-04-18 15:51:09,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:09,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894799210] [2020-04-18 15:51:09,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:09,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894799210] [2020-04-18 15:51:09,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:09,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 15:51:09,738 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:09,744 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:09,755 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-04-18 15:51:09,756 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:09,863 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 15:51:09,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:51:09,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-04-18 15:51:09,892 INFO L87 Difference]: Start difference. First operand 305 states and 648 transitions. Second operand 7 states. [2020-04-18 15:51:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:10,399 INFO L93 Difference]: Finished difference Result 345 states and 714 transitions. [2020-04-18 15:51:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 714 transitions. [2020-04-18 15:51:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:10,401 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:51:10,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1064317376, now seen corresponding path program 4 times [2020-04-18 15:51:10,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:10,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438648027] [2020-04-18 15:51:10,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:10,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438648027] [2020-04-18 15:51:10,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:10,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 15:51:10,808 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:10,816 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:10,830 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2020-04-18 15:51:10,830 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:10,962 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:51:10,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 15:51:10,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-04-18 15:51:10,963 INFO L87 Difference]: Start difference. First operand 345 states and 714 transitions. Second operand 8 states. [2020-04-18 15:51:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:11,886 INFO L93 Difference]: Finished difference Result 462 states and 916 transitions. [2020-04-18 15:51:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 916 transitions. [2020-04-18 15:51:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:11,888 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:51:11,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:11,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1830623652, now seen corresponding path program 5 times [2020-04-18 15:51:11,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:11,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659368467] [2020-04-18 15:51:11,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:12,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659368467] [2020-04-18 15:51:12,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:12,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 15:51:12,454 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:12,460 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:12,474 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2020-04-18 15:51:12,475 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:12,671 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:12,676 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:12,681 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:12,687 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:12,745 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:12,749 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:12,762 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:12,766 INFO L539 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:12,769 INFO L539 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:12,788 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:12,789 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-04-18 15:51:12,789 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:160, output treesize:28 [2020-04-18 15:51:12,882 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 7 times. [2020-04-18 15:51:12,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 15:51:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2020-04-18 15:51:12,883 INFO L87 Difference]: Start difference. First operand 462 states and 916 transitions. Second operand 10 states. [2020-04-18 15:51:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:14,033 INFO L93 Difference]: Finished difference Result 646 states and 1278 transitions. [2020-04-18 15:51:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1278 transitions. [2020-04-18 15:51:14,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:51:14,035 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1902830858] [2020-04-18 15:51:14,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:51:14,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-04-18 15:51:14,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1902830858] [2020-04-18 15:51:14,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 15:51:14,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:51:14,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 15:51:14,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=598, Unknown=0, NotChecked=0, Total=812 [2020-04-18 15:51:14,037 INFO L87 Difference]: Start difference. First operand 114 states and 195 transitions. Second operand 15 states. [2020-04-18 15:51:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:15,057 INFO L93 Difference]: Finished difference Result 110 states and 184 transitions. [2020-04-18 15:51:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-18 15:51:15,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-04-18 15:51:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:51:15,059 INFO L225 Difference]: With dead ends: 110 [2020-04-18 15:51:15,059 INFO L226 Difference]: Without dead ends: 110 [2020-04-18 15:51:15,060 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 92 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=301, Invalid=821, Unknown=0, NotChecked=0, Total=1122 [2020-04-18 15:51:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-04-18 15:51:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2020-04-18 15:51:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-04-18 15:51:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2020-04-18 15:51:15,065 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 161 transitions. Word has length 22 [2020-04-18 15:51:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:51:15,066 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 161 transitions. [2020-04-18 15:51:15,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 15:51:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 161 transitions. [2020-04-18 15:51:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:15,068 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:51:15,068 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:51:15,068 INFO L427 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]=== [2020-04-18 15:51:15,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:15,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 1 times [2020-04-18 15:51:15,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:51:15,069 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1363171450] [2020-04-18 15:51:15,070 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:15,074 INFO L259 McrAutomatonBuilder]: Finished intersection with 143 states and 312 transitions. [2020-04-18 15:51:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-04-18 15:51:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:15,077 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:51:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 2 times [2020-04-18 15:51:15,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:15,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672812710] [2020-04-18 15:51:15,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:16,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672812710] [2020-04-18 15:51:16,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:16,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:51:16,366 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:16,371 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:16,379 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 26 transitions. [2020-04-18 15:51:16,380 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:16,964 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 15:51:16,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 15:51:16,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-04-18 15:51:16,964 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 15 states. [2020-04-18 15:51:17,473 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-04-18 15:51:19,135 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2020-04-18 15:51:19,452 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2020-04-18 15:51:19,946 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2020-04-18 15:51:20,224 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-04-18 15:51:20,370 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-04-18 15:51:20,566 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-04-18 15:51:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:21,535 INFO L93 Difference]: Finished difference Result 255 states and 527 transitions. [2020-04-18 15:51:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 527 transitions. [2020-04-18 15:51:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:21,536 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:51:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:21,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732572, now seen corresponding path program 3 times [2020-04-18 15:51:21,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:21,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312078431] [2020-04-18 15:51:21,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:21,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312078431] [2020-04-18 15:51:21,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:21,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:51:21,673 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:21,677 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:21,688 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 42 transitions. [2020-04-18 15:51:21,688 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:21,838 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:21,842 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:21,845 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:21,847 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:21,847 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 15:51:21,848 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:1 [2020-04-18 15:51:22,007 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 15:51:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:51:22,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 15:51:22,008 INFO L87 Difference]: Start difference. First operand 255 states and 527 transitions. Second operand 6 states. [2020-04-18 15:51:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:22,129 INFO L93 Difference]: Finished difference Result 435 states and 888 transitions. [2020-04-18 15:51:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 888 transitions. [2020-04-18 15:51:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:22,130 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:51:22,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1729521388, now seen corresponding path program 4 times [2020-04-18 15:51:22,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:22,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685241618] [2020-04-18 15:51:22,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:22,453 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2020-04-18 15:51:22,594 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2020-04-18 15:51:22,725 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2020-04-18 15:51:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:23,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685241618] [2020-04-18 15:51:23,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:23,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:51:23,328 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:23,332 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:23,341 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 30 transitions. [2020-04-18 15:51:23,342 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:23,439 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:51:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 15:51:23,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2020-04-18 15:51:23,440 INFO L87 Difference]: Start difference. First operand 435 states and 888 transitions. Second operand 15 states. [2020-04-18 15:51:25,249 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2020-04-18 15:51:25,804 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-04-18 15:51:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:26,790 INFO L93 Difference]: Finished difference Result 646 states and 1219 transitions. [2020-04-18 15:51:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1219 transitions. [2020-04-18 15:51:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:26,793 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:51:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:26,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1321376162, now seen corresponding path program 5 times [2020-04-18 15:51:26,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:26,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715151612] [2020-04-18 15:51:26,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:27,107 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2020-04-18 15:51:27,533 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-04-18 15:51:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:27,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715151612] [2020-04-18 15:51:27,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:27,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:51:27,903 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:27,906 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:27,914 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2020-04-18 15:51:27,914 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:28,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2020-04-18 15:51:28,351 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-04-18 15:51:28,568 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 7 times. [2020-04-18 15:51:28,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 15:51:28,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1700, Unknown=0, NotChecked=0, Total=1980 [2020-04-18 15:51:28,570 INFO L87 Difference]: Start difference. First operand 646 states and 1219 transitions. Second operand 16 states. [2020-04-18 15:51:29,700 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2020-04-18 15:51:30,040 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2020-04-18 15:51:30,927 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 37 [2020-04-18 15:51:31,790 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 40 [2020-04-18 15:51:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:32,881 INFO L93 Difference]: Finished difference Result 765 states and 1386 transitions. [2020-04-18 15:51:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1386 transitions. [2020-04-18 15:51:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:32,883 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 15:51:32,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1314893868, now seen corresponding path program 6 times [2020-04-18 15:51:32,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:32,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557624993] [2020-04-18 15:51:32,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:33,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557624993] [2020-04-18 15:51:33,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:33,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:51:33,936 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:33,940 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:33,947 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-04-18 15:51:33,947 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:34,145 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 7 times. [2020-04-18 15:51:34,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 15:51:34,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2392, Unknown=0, NotChecked=0, Total=2756 [2020-04-18 15:51:34,147 INFO L87 Difference]: Start difference. First operand 765 states and 1386 transitions. Second operand 15 states. [2020-04-18 15:51:35,646 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-04-18 15:51:35,997 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-04-18 15:51:37,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:37,496 INFO L93 Difference]: Finished difference Result 844 states and 1485 transitions. [2020-04-18 15:51:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1485 transitions. [2020-04-18 15:51:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:37,499 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 15:51:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash -761551564, now seen corresponding path program 7 times [2020-04-18 15:51:37,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:37,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614195254] [2020-04-18 15:51:37,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:38,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614195254] [2020-04-18 15:51:38,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:38,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:51:38,589 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:38,592 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:38,603 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-04-18 15:51:38,603 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:38,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2020-04-18 15:51:38,967 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 9 times. [2020-04-18 15:51:38,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 15:51:38,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=3324, Unknown=0, NotChecked=0, Total=3782 [2020-04-18 15:51:38,969 INFO L87 Difference]: Start difference. First operand 844 states and 1485 transitions. Second operand 16 states. [2020-04-18 15:51:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:41,625 INFO L93 Difference]: Finished difference Result 855 states and 1493 transitions. [2020-04-18 15:51:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1493 transitions. [2020-04-18 15:51:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:41,628 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 15:51:41,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash 2063652278, now seen corresponding path program 8 times [2020-04-18 15:51:41,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:41,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427788736] [2020-04-18 15:51:41,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:41,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427788736] [2020-04-18 15:51:41,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:41,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:51:41,742 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:41,746 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:41,755 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-04-18 15:51:41,755 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:42,325 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,331 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,337 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,342 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,347 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,457 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-04-18 15:51:42,457 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:42,460 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,466 INFO L539 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,472 INFO L539 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,475 INFO L539 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,480 INFO L539 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:42,562 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:42,563 INFO L539 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2020-04-18 15:51:42,563 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:246, output treesize:86 [2020-04-18 15:51:42,564 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 15:51:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 15:51:42,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=3916, Unknown=0, NotChecked=0, Total=4422 [2020-04-18 15:51:42,566 INFO L87 Difference]: Start difference. First operand 855 states and 1493 transitions. Second operand 8 states. [2020-04-18 15:51:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:42,756 INFO L93 Difference]: Finished difference Result 864 states and 1501 transitions. [2020-04-18 15:51:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1501 transitions. [2020-04-18 15:51:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:42,759 INFO L105 Mcr]: ---- MCR iteration 7 ---- [2020-04-18 15:51:42,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:42,759 INFO L82 PathProgramCache]: Analyzing trace with hash -552633476, now seen corresponding path program 9 times [2020-04-18 15:51:42,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:42,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301540236] [2020-04-18 15:51:42,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:43,241 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2020-04-18 15:51:43,507 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2020-04-18 15:51:43,680 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2020-04-18 15:51:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:44,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301540236] [2020-04-18 15:51:44,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:44,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:51:44,165 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:44,169 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:44,180 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-04-18 15:51:44,180 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:45,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2020-04-18 15:51:45,942 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-04-18 15:51:46,229 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-04-18 15:51:46,281 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,287 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,294 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,301 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,307 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,313 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,319 INFO L539 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,325 INFO L539 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,553 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-04-18 15:51:46,553 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:46,557 INFO L539 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,562 INFO L539 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,575 INFO L539 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,583 INFO L539 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,589 INFO L539 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,595 INFO L539 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,601 INFO L539 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,608 INFO L539 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:46,755 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-04-18 15:51:46,756 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:46,759 INFO L539 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 8 xjuncts. [2020-04-18 15:51:46,759 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:401, output treesize:145 [2020-04-18 15:51:47,010 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-04-18 15:51:47,010 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 15:51:47,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 15:51:47,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=5277, Unknown=0, NotChecked=0, Total=5852 [2020-04-18 15:51:47,013 INFO L87 Difference]: Start difference. First operand 864 states and 1501 transitions. Second operand 17 states. [2020-04-18 15:51:47,417 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2020-04-18 15:51:48,247 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 32 [2020-04-18 15:51:48,920 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2020-04-18 15:51:49,320 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 34 [2020-04-18 15:51:49,641 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 55 [2020-04-18 15:51:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:51,581 INFO L93 Difference]: Finished difference Result 994 states and 1711 transitions. [2020-04-18 15:51:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1711 transitions. [2020-04-18 15:51:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:51,583 INFO L105 Mcr]: ---- MCR iteration 8 ---- [2020-04-18 15:51:51,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:51,584 INFO L82 PathProgramCache]: Analyzing trace with hash 779226054, now seen corresponding path program 10 times [2020-04-18 15:51:51,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:51,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009339791] [2020-04-18 15:51:51,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:51,920 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2020-04-18 15:51:52,071 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2020-04-18 15:51:52,201 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2020-04-18 15:51:52,345 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-04-18 15:51:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:52,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009339791] [2020-04-18 15:51:52,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:52,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:51:52,952 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:52,955 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:52,963 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-04-18 15:51:52,963 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:53,301 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,313 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,317 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,321 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,325 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,331 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,360 INFO L539 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,365 INFO L539 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,459 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:53,463 INFO L539 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,466 INFO L539 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,470 INFO L539 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,475 INFO L539 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,478 INFO L539 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,483 INFO L539 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,486 INFO L539 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,489 INFO L539 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:53,521 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:53,521 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-04-18 15:51:53,521 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:310, output treesize:46 [2020-04-18 15:51:53,656 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 15:51:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 15:51:53,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=6970, Unknown=0, NotChecked=0, Total=7656 [2020-04-18 15:51:53,658 INFO L87 Difference]: Start difference. First operand 994 states and 1711 transitions. Second operand 16 states. [2020-04-18 15:51:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:51:56,178 INFO L93 Difference]: Finished difference Result 1257 states and 2149 transitions. [2020-04-18 15:51:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2149 transitions. [2020-04-18 15:51:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:51:56,181 INFO L105 Mcr]: ---- MCR iteration 9 ---- [2020-04-18 15:51:56,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:51:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash 571806310, now seen corresponding path program 11 times [2020-04-18 15:51:56,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:51:56,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285155344] [2020-04-18 15:51:56,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:51:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:51:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:51:57,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285155344] [2020-04-18 15:51:57,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:51:57,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:51:57,224 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:51:57,228 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:51:57,240 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 56 transitions. [2020-04-18 15:51:57,240 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:51:57,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2020-04-18 15:51:57,646 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-04-18 15:51:57,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2020-04-18 15:51:57,912 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-04-18 15:51:58,178 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-04-18 15:51:58,426 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,431 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,437 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,442 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,445 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,451 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,455 INFO L539 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,462 INFO L539 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,551 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:58,558 INFO L539 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,561 INFO L539 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,566 INFO L539 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,569 INFO L539 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,573 INFO L539 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,577 INFO L539 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,580 INFO L539 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,586 INFO L539 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-04-18 15:51:58,619 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:51:58,620 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-04-18 15:51:58,620 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:310, output treesize:46 [2020-04-18 15:51:58,625 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 12 times. [2020-04-18 15:51:58,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 15:51:58,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=8134, Unknown=0, NotChecked=0, Total=8930 [2020-04-18 15:51:58,628 INFO L87 Difference]: Start difference. First operand 1257 states and 2149 transitions. Second operand 19 states. [2020-04-18 15:52:00,040 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 49 [2020-04-18 15:52:01,249 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 39 [2020-04-18 15:52:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:02,237 INFO L93 Difference]: Finished difference Result 1393 states and 2385 transitions. [2020-04-18 15:52:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2385 transitions. [2020-04-18 15:52:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:52:02,240 INFO L105 Mcr]: ---- MCR iteration 10 ---- [2020-04-18 15:52:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:52:02,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323498, now seen corresponding path program 12 times [2020-04-18 15:52:02,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:52:02,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762576811] [2020-04-18 15:52:02,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:52:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:52:02,742 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2020-04-18 15:52:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:52:03,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762576811] [2020-04-18 15:52:03,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:52:03,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:52:03,553 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:52:03,558 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:52:03,572 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-04-18 15:52:03,573 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:52:03,852 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,856 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,860 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,864 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,870 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,874 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,877 INFO L539 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,882 INFO L539 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,969 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:52:03,972 INFO L539 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,979 INFO L539 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,982 INFO L539 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,986 INFO L539 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,991 INFO L539 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,995 INFO L539 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:03,998 INFO L539 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:04,002 INFO L539 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:04,034 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:52:04,034 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-04-18 15:52:04,035 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:310, output treesize:46 [2020-04-18 15:52:04,035 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 12 times. [2020-04-18 15:52:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 15:52:04,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=882, Invalid=9018, Unknown=0, NotChecked=0, Total=9900 [2020-04-18 15:52:04,039 INFO L87 Difference]: Start difference. First operand 1393 states and 2385 transitions. Second operand 16 states. [2020-04-18 15:52:05,543 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-04-18 15:52:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:07,012 INFO L93 Difference]: Finished difference Result 1542 states and 2590 transitions. [2020-04-18 15:52:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2590 transitions. [2020-04-18 15:52:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:52:07,015 INFO L105 Mcr]: ---- MCR iteration 11 ---- [2020-04-18 15:52:07,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:52:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash 280732566, now seen corresponding path program 13 times [2020-04-18 15:52:07,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:52:07,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821669300] [2020-04-18 15:52:07,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:52:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:52:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:52:07,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821669300] [2020-04-18 15:52:07,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:52:07,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 15:52:07,886 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:52:07,890 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:52:07,903 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 62 transitions. [2020-04-18 15:52:07,904 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:52:08,184 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,188 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,193 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,196 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,201 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,205 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,208 INFO L539 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,213 INFO L539 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,305 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:52:08,308 INFO L539 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,313 INFO L539 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,317 INFO L539 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,321 INFO L539 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,324 INFO L539 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,329 INFO L539 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,332 INFO L539 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,335 INFO L539 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:08,364 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:52:08,365 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-04-18 15:52:08,365 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:310, output treesize:46 [2020-04-18 15:52:08,365 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 14 times. [2020-04-18 15:52:08,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 15:52:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=943, Invalid=9977, Unknown=0, NotChecked=0, Total=10920 [2020-04-18 15:52:08,369 INFO L87 Difference]: Start difference. First operand 1542 states and 2590 transitions. Second operand 15 states. [2020-04-18 15:52:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:10,562 INFO L93 Difference]: Finished difference Result 1599 states and 2659 transitions. [2020-04-18 15:52:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2659 transitions. [2020-04-18 15:52:10,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:52:10,566 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1363171450] [2020-04-18 15:52:10,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:52:10,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-04-18 15:52:10,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1363171450] [2020-04-18 15:52:10,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2020-04-18 15:52:10,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:52:10,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2020-04-18 15:52:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=10175, Unknown=0, NotChecked=0, Total=11130 [2020-04-18 15:52:10,568 INFO L87 Difference]: Start difference. First operand 96 states and 161 transitions. Second operand 54 states. [2020-04-18 15:52:14,784 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-04-18 15:52:14,986 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-04-18 15:52:15,727 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-04-18 15:52:15,994 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-04-18 15:52:16,586 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-04-18 15:52:16,880 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-04-18 15:52:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:17,468 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2020-04-18 15:52:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-18 15:52:17,468 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 22 [2020-04-18 15:52:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:52:17,469 INFO L225 Difference]: With dead ends: 95 [2020-04-18 15:52:17,469 INFO L226 Difference]: Without dead ends: 95 [2020-04-18 15:52:17,471 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 284 SyntacticMatches, 50 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8404 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=1484, Invalid=15286, Unknown=0, NotChecked=0, Total=16770 [2020-04-18 15:52:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-04-18 15:52:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-04-18 15:52:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-04-18 15:52:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 160 transitions. [2020-04-18 15:52:17,474 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 160 transitions. Word has length 22 [2020-04-18 15:52:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:52:17,475 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 160 transitions. [2020-04-18 15:52:17,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 54 states. [2020-04-18 15:52:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 160 transitions. [2020-04-18 15:52:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:52:17,475 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:52:17,476 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:52:17,476 INFO L427 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]=== [2020-04-18 15:52:17,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:52:17,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 1 times [2020-04-18 15:52:17,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:52:17,477 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [395109356] [2020-04-18 15:52:17,477 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:52:17,479 INFO L259 McrAutomatonBuilder]: Finished intersection with 143 states and 312 transitions. [2020-04-18 15:52:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-04-18 15:52:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:52:17,481 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:52:17,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:52:17,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 2 times [2020-04-18 15:52:17,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:52:17,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764627027] [2020-04-18 15:52:17,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:52:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:52:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:52:17,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764627027] [2020-04-18 15:52:17,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:52:17,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 15:52:17,819 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:52:17,822 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:52:17,850 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 26 transitions. [2020-04-18 15:52:17,850 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:52:18,012 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:52:18,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 15:52:18,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-04-18 15:52:18,013 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 9 states. [2020-04-18 15:52:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:18,784 INFO L93 Difference]: Finished difference Result 294 states and 619 transitions. [2020-04-18 15:52:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 619 transitions. [2020-04-18 15:52:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:52:18,785 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:52:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:52:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1692602848, now seen corresponding path program 3 times [2020-04-18 15:52:18,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:52:18,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971269640] [2020-04-18 15:52:18,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:52:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:52:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:52:18,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971269640] [2020-04-18 15:52:18,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:52:18,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:52:18,887 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:52:18,891 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:52:18,901 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2020-04-18 15:52:18,901 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:52:19,011 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:19,018 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:52:19,022 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:19,025 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:52:19,025 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 15:52:19,025 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:1 [2020-04-18 15:52:19,158 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 15:52:19,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:52:19,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-04-18 15:52:19,159 INFO L87 Difference]: Start difference. First operand 294 states and 619 transitions. Second operand 6 states. [2020-04-18 15:52:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:19,324 INFO L93 Difference]: Finished difference Result 386 states and 767 transitions. [2020-04-18 15:52:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 767 transitions. [2020-04-18 15:52:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:52:19,325 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:52:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:52:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400276, now seen corresponding path program 4 times [2020-04-18 15:52:19,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:52:19,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135564823] [2020-04-18 15:52:19,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:52:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:52:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:52:19,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135564823] [2020-04-18 15:52:19,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:52:19,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 15:52:19,723 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:52:19,727 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:52:19,737 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2020-04-18 15:52:19,738 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:52:19,857 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:52:19,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 15:52:19,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2020-04-18 15:52:19,857 INFO L87 Difference]: Start difference. First operand 386 states and 767 transitions. Second operand 10 states. [2020-04-18 15:52:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:20,974 INFO L93 Difference]: Finished difference Result 421 states and 827 transitions. [2020-04-18 15:52:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 827 transitions. [2020-04-18 15:52:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:52:20,975 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:52:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:52:20,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1952444742, now seen corresponding path program 5 times [2020-04-18 15:52:20,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:52:20,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808308489] [2020-04-18 15:52:20,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:52:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:52:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:52:21,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808308489] [2020-04-18 15:52:21,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:52:21,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:52:21,072 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:52:21,077 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:52:21,087 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2020-04-18 15:52:21,088 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:52:21,443 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,448 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,461 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,465 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,468 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,578 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-04-18 15:52:21,578 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:52:21,582 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,588 INFO L539 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,594 INFO L539 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,598 INFO L539 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,601 INFO L539 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-04-18 15:52:21,685 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 15:52:21,688 INFO L539 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2020-04-18 15:52:21,688 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:246, output treesize:86 [2020-04-18 15:52:21,688 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 15:52:21,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 15:52:21,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2020-04-18 15:52:21,689 INFO L87 Difference]: Start difference. First operand 421 states and 827 transitions. Second operand 8 states. [2020-04-18 15:52:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:21,903 INFO L93 Difference]: Finished difference Result 456 states and 859 transitions. [2020-04-18 15:52:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 859 transitions. [2020-04-18 15:52:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:52:21,905 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 15:52:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:52:21,905 INFO L82 PathProgramCache]: Analyzing trace with hash -552633486, now seen corresponding path program 6 times [2020-04-18 15:52:21,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:52:21,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801077567] [2020-04-18 15:52:21,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:52:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:52:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:52:22,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801077567] [2020-04-18 15:52:22,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:52:22,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 15:52:22,196 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:52:22,199 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:52:22,206 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-04-18 15:52:22,206 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:52:22,302 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:52:22,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 15:52:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2020-04-18 15:52:22,302 INFO L87 Difference]: Start difference. First operand 456 states and 859 transitions. Second operand 8 states. [2020-04-18 15:52:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:22,850 INFO L93 Difference]: Finished difference Result 678 states and 1198 transitions. [2020-04-18 15:52:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1198 transitions. [2020-04-18 15:52:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:52:22,851 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 15:52:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:52:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019508, now seen corresponding path program 7 times [2020-04-18 15:52:22,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:52:22,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759086966] [2020-04-18 15:52:22,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:52:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:52:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:52:23,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759086966] [2020-04-18 15:52:23,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:52:23,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 15:52:23,156 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:52:23,159 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:52:23,168 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 56 transitions. [2020-04-18 15:52:23,168 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:52:23,301 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:52:23,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 15:52:23,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 15:52:23,302 INFO L87 Difference]: Start difference. First operand 678 states and 1198 transitions. Second operand 10 states. [2020-04-18 15:52:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:24,466 INFO L93 Difference]: Finished difference Result 756 states and 1338 transitions. [2020-04-18 15:52:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1338 transitions. [2020-04-18 15:52:24,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:52:24,468 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [395109356] [2020-04-18 15:52:24,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:52:24,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-04-18 15:52:24,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [395109356] [2020-04-18 15:52:24,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-04-18 15:52:24,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:52:24,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-04-18 15:52:24,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 15:52:24,470 INFO L87 Difference]: Start difference. First operand 95 states and 160 transitions. Second operand 22 states. [2020-04-18 15:52:25,797 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2020-04-18 15:52:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:52:26,422 INFO L93 Difference]: Finished difference Result 94 states and 159 transitions. [2020-04-18 15:52:26,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-18 15:52:26,422 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2020-04-18 15:52:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:52:26,423 INFO L225 Difference]: With dead ends: 94 [2020-04-18 15:52:26,423 INFO L226 Difference]: Without dead ends: 0 [2020-04-18 15:52:26,424 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 129 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=499, Invalid=1951, Unknown=0, NotChecked=0, Total=2450 [2020-04-18 15:52:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-04-18 15:52:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-04-18 15:52:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-04-18 15:52:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-04-18 15:52:26,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-04-18 15:52:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:52:26,425 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-04-18 15:52:26,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-04-18 15:52:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-04-18 15:52:26,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:52:26,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 03:52:26 BasicIcfg [2020-04-18 15:52:26,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 15:52:26,431 INFO L168 Benchmark]: Toolchain (without parser) took 92828.07 ms. Allocated memory was 144.2 MB in the beginning and 534.2 MB in the end (delta: 390.1 MB). Free memory was 98.5 MB in the beginning and 419.3 MB in the end (delta: -320.8 MB). Peak memory consumption was 69.3 MB. Max. memory is 7.1 GB. [2020-04-18 15:52:26,432 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-04-18 15:52:26,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1479.47 ms. Allocated memory was 144.2 MB in the beginning and 233.8 MB in the end (delta: 89.7 MB). Free memory was 96.5 MB in the beginning and 173.6 MB in the end (delta: -77.1 MB). Peak memory consumption was 75.4 MB. Max. memory is 7.1 GB. [2020-04-18 15:52:26,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.17 ms. Allocated memory is still 233.8 MB. Free memory was 173.6 MB in the beginning and 170.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-04-18 15:52:26,433 INFO L168 Benchmark]: Boogie Preprocessor took 49.05 ms. Allocated memory is still 233.8 MB. Free memory was 170.6 MB in the beginning and 167.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-04-18 15:52:26,433 INFO L168 Benchmark]: RCFGBuilder took 897.09 ms. Allocated memory is still 233.8 MB. Free memory was 167.7 MB in the beginning and 119.0 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2020-04-18 15:52:26,433 INFO L168 Benchmark]: TraceAbstraction took 90271.58 ms. Allocated memory was 233.8 MB in the beginning and 534.2 MB in the end (delta: 300.4 MB). Free memory was 119.0 MB in the beginning and 419.3 MB in the end (delta: -300.3 MB). Peak memory consumption was 88.8 kB. Max. memory is 7.1 GB. [2020-04-18 15:52:26,435 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1479.47 ms. Allocated memory was 144.2 MB in the beginning and 233.8 MB in the end (delta: 89.7 MB). Free memory was 96.5 MB in the beginning and 173.6 MB in the end (delta: -77.1 MB). Peak memory consumption was 75.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 109.17 ms. Allocated memory is still 233.8 MB. Free memory was 173.6 MB in the beginning and 170.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.05 ms. Allocated memory is still 233.8 MB. Free memory was 170.6 MB in the beginning and 167.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 897.09 ms. Allocated memory is still 233.8 MB. Free memory was 167.7 MB in the beginning and 119.0 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90271.58 ms. Allocated memory was 233.8 MB in the beginning and 534.2 MB in the end (delta: 300.4 MB). Free memory was 119.0 MB in the beginning and 419.3 MB in the end (delta: -300.3 MB). Peak memory consumption was 88.8 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 10.9s, 150 ProgramPointsBefore, 40 ProgramPointsAfterwards, 154 TransitionsBefore, 38 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 1372 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5194 CheckedPairsTotal, 168 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. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 90.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 190 SDtfs, 356 SDslu, 653 SDs, 0 SdLazy, 2483 SolverSat, 364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 521 SyntacticMatches, 68 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9590 ImplicationChecksByTransitivity, 22.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 110 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...