/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:56:45,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:56:45,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:56:45,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:56:45,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:56:45,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:56:45,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:56:45,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:56:45,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:56:45,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:56:45,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:56:45,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:56:45,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:56:45,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:56:45,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:56:45,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:56:45,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:56:45,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:56:45,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:56:45,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:56:45,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:56:45,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:56:45,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:56:45,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:56:45,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:56:45,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:56:45,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:56:45,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:56:45,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:56:45,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:56:45,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:56:45,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:56:45,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:56:45,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:56:45,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:56:45,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:56:45,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:56:45,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:56:45,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:56:45,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:56:45,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:56:45,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:56:45,280 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:56:45,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:56:45,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:56:45,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:56:45,284 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:56:45,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:56:45,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:56:45,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:56:45,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:56:45,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:56:45,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:56:45,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:56:45,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:56:45,286 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:56:45,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:56:45,286 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:56:45,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:56:45,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:56:45,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:56:45,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:56:45,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:56:45,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:56:45,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:56:45,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:56:45,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:56:45,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:56:45,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:56:45,294 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:56:45,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:56:45,294 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:56:45,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:56:45,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:56:45,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:56:45,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:56:45,589 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:56:45,589 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:56:45,591 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2019-12-27 18:56:45,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e79b544/5cd56d2f92d545969551b457af904105/FLAGe44d6a996 [2019-12-27 18:56:46,246 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:56:46,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2019-12-27 18:56:46,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e79b544/5cd56d2f92d545969551b457af904105/FLAGe44d6a996 [2019-12-27 18:56:46,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e79b544/5cd56d2f92d545969551b457af904105 [2019-12-27 18:56:46,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:56:46,501 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:56:46,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:56:46,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:56:46,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:56:46,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:56:46" (1/1) ... [2019-12-27 18:56:46,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747c2c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:46, skipping insertion in model container [2019-12-27 18:56:46,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:56:46" (1/1) ... [2019-12-27 18:56:46,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:56:46,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:56:47,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:56:47,383 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:56:47,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:56:47,926 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:56:47,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47 WrapperNode [2019-12-27 18:56:47,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:56:47,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:56:47,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:56:47,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:56:47,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... [2019-12-27 18:56:47,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... [2019-12-27 18:56:48,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:56:48,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:56:48,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:56:48,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:56:48,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... [2019-12-27 18:56:48,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... [2019-12-27 18:56:48,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... [2019-12-27 18:56:48,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... [2019-12-27 18:56:48,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... [2019-12-27 18:56:48,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... [2019-12-27 18:56:48,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... [2019-12-27 18:56:48,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:56:48,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:56:48,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:56:48,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:56:48,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:56:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:56:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 18:56:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 18:56:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 18:56:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:56:48,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:56:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 18:56:48,153 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 18:56:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:56:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:56:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 18:56:48,156 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:56:48,940 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:56:48,940 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 18:56:48,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:56:48 BoogieIcfgContainer [2019-12-27 18:56:48,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:56:48,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:56:48,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:56:48,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:56:48,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:56:46" (1/3) ... [2019-12-27 18:56:48,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341bdf95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:56:48, skipping insertion in model container [2019-12-27 18:56:48,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:56:47" (2/3) ... [2019-12-27 18:56:48,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341bdf95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:56:48, skipping insertion in model container [2019-12-27 18:56:48,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:56:48" (3/3) ... [2019-12-27 18:56:48,951 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2019-12-27 18:56:48,962 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:56:48,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:56:48,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 18:56:48,976 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:56:49,013 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,013 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,013 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,014 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,014 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,014 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,014 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,015 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,015 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,015 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,015 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,016 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,016 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,016 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,016 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,016 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,017 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,017 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,017 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,017 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,018 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,018 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,018 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,018 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,019 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,019 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,019 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,019 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,020 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,020 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,020 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,020 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,021 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,021 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,021 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,022 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,022 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,022 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,022 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,023 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,023 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,023 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,023 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,024 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,024 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,024 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,024 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,025 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,025 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,025 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,025 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,025 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,026 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,026 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,026 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,026 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,027 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,027 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,027 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,028 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,028 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,028 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,028 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,029 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,029 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,029 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,030 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,030 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,030 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,030 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,034 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,035 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,035 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,035 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,035 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,036 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,036 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,036 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,036 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,036 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,037 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,037 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,045 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,045 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,045 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,046 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,046 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,046 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,046 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,047 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,047 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,047 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,047 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,048 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:49,087 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 18:56:49,114 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:56:49,114 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:56:49,115 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:56:49,115 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:56:49,115 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:56:49,115 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:56:49,115 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:56:49,116 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:56:49,145 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 155 transitions [2019-12-27 18:56:49,147 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-27 18:56:49,278 INFO L132 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-27 18:56:49,278 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 18:56:49,294 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 18:56:49,302 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-27 18:56:49,375 INFO L132 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-27 18:56:49,376 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 18:56:49,379 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 18:56:49,386 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2884 [2019-12-27 18:56:49,388 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:56:49,560 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:49,601 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:49,608 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:49,641 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:49,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:49,643 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:56:49,663 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:49,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:49,713 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:49,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:49,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:49,749 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:56:51,815 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:51,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:51,876 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:51,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:51,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:51,912 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:56:51,933 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:51,974 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:51,999 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:52,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:52,041 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:52,042 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:56:54,531 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:54,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:54,587 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:54,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:54,623 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:54,623 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:56:54,640 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:54,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:54,680 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:54,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:54,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:54,715 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:56:56,857 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:56,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:56,906 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:56,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:56,934 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:56,934 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:56:56,949 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:56,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:56,989 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:57,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:57,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:57,043 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:56:59,330 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:59,362 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:59,368 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:59,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:59,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:59,401 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:56:59,429 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:59,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:59,476 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:59,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:56:59,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:56:59,506 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:57:02,251 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:02,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:02,304 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:02,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:02,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:02,339 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:57:02,371 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:02,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:02,416 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:02,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:02,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:02,464 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 18:57:04,492 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:04,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:04,536 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:04,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:04,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:04,579 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:04,594 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:04,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:04,634 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:04,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:04,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:04,666 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:57:06,684 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:06,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:06,721 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:06,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:06,753 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:06,753 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:57:06,770 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:06,804 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:06,809 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:06,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:06,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:06,837 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:09,157 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:09,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:09,201 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:09,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:09,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:09,238 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:57:09,257 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:09,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:09,310 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:09,350 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:09,351 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:09,352 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 18:57:11,646 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:11,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:11,699 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:11,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:11,744 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:11,744 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 18:57:11,760 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:11,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:11,815 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:11,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:11,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:11,859 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:57:14,150 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:14,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:14,209 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:14,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:14,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:14,247 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:14,264 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:14,302 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:14,306 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:14,338 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:14,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:14,340 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:16,873 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:16,930 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:16,937 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:16,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:16,980 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:16,980 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:16,995 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:17,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:17,048 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:17,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:17,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:17,087 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:19,109 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:19,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:19,153 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:19,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:19,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:19,190 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:19,225 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:19,317 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:19,322 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:19,358 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:19,359 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:19,359 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:21,568 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:21,607 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:21,611 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:21,646 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:21,647 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:21,647 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:21,661 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:21,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:21,706 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:21,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:21,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:21,743 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:24,110 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-27 18:57:24,280 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:24,324 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:24,329 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:24,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:24,358 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:24,358 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:57:24,371 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:24,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:24,413 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:24,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:24,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:24,443 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:26,589 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:26,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:26,644 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:26,690 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:26,691 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:26,691 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:26,712 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:26,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:26,789 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:26,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:26,852 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:26,853 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:57:28,943 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:28,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:28,979 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:29,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:29,006 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:29,007 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-27 18:57:29,119 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:29,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:29,158 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:29,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:29,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:29,215 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:57:29,238 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:29,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:29,278 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:29,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:29,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:29,312 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:57:31,745 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:31,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:31,788 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:31,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:31,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:31,816 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:57:31,828 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:31,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:31,872 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:31,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:31,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:31,903 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:57:33,952 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:33,996 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:34,002 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:34,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,040 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 18:57:34,055 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:34,110 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:34,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,155 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-27 18:57:34,174 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:34,228 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:34,266 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,266 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:57:34,279 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:34,313 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:34,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:34,340 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:57:36,456 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:36,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:36,504 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:36,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:36,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:36,533 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 18:57:36,549 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:36,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:36,584 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:36,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:36,612 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:36,612 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-27 18:57:38,741 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:38,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:38,778 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:38,804 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:38,805 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:38,805 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-27 18:57:38,819 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:38,854 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:38,860 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:38,886 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:38,887 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:38,887 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 18:57:41,274 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-27 18:57:41,506 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 18:57:41,619 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 18:57:42,211 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 18:57:42,300 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:42,344 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:42,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,372 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-27 18:57:42,385 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:42,425 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:42,452 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,452 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 18:57:42,467 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:42,508 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,537 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:42,538 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,538 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:57:42,551 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:42,594 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:42,626 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:42,627 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:57:44,940 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-27 18:57:45,164 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-27 18:57:45,805 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-12-27 18:57:46,015 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-27 18:57:46,853 WARN L192 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2019-12-27 18:57:46,891 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:47,364 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-27 18:57:47,365 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:47,381 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:47,841 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-27 18:57:47,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:47,842 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:47,842 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:250, output treesize:222 [2019-12-27 18:57:48,180 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-27 18:57:49,704 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2019-12-27 18:57:49,723 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:50,384 WARN L192 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 18:57:50,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:50,394 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:50,981 WARN L192 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 18:57:50,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:57:50,982 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 18:57:50,982 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2019-12-27 18:57:51,512 WARN L192 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 18:57:51,837 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-27 18:57:52,139 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-27 18:57:52,153 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5217 [2019-12-27 18:57:52,153 INFO L214 etLargeBlockEncoding]: Total number of compositions: 160 [2019-12-27 18:57:52,157 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 41 transitions [2019-12-27 18:57:52,186 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 462 states. [2019-12-27 18:57:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states. [2019-12-27 18:57:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 18:57:52,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:52,195 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 18:57:52,195 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2019-12-27 18:57:52,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:52,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761837450] [2019-12-27 18:57:52,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:52,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761837450] [2019-12-27 18:57:52,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:52,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 18:57:52,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1341570827] [2019-12-27 18:57:52,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:52,516 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:52,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 2 states and 1 transitions. [2019-12-27 18:57:52,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:52,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:52,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 18:57:52,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:52,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 18:57:52,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 18:57:52,544 INFO L87 Difference]: Start difference. First operand 462 states. Second operand 2 states. [2019-12-27 18:57:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:52,585 INFO L93 Difference]: Finished difference Result 460 states and 1126 transitions. [2019-12-27 18:57:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 18:57:52,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 18:57:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:52,602 INFO L225 Difference]: With dead ends: 460 [2019-12-27 18:57:52,602 INFO L226 Difference]: Without dead ends: 385 [2019-12-27 18:57:52,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 18:57:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-27 18:57:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-12-27 18:57:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-12-27 18:57:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2019-12-27 18:57:52,681 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2019-12-27 18:57:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:52,681 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2019-12-27 18:57:52,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 18:57:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2019-12-27 18:57:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 18:57:52,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:52,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 18:57:52,682 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 17095183, now seen corresponding path program 1 times [2019-12-27 18:57:52,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:52,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179502655] [2019-12-27 18:57:52,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:52,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179502655] [2019-12-27 18:57:52,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:52,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:57:52,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737918842] [2019-12-27 18:57:52,876 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:52,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:52,878 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 18:57:52,878 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:52,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:52,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:57:52,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:52,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:57:52,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:57:52,880 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2019-12-27 18:57:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:53,066 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2019-12-27 18:57:53,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:57:53,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 18:57:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:53,075 INFO L225 Difference]: With dead ends: 540 [2019-12-27 18:57:53,075 INFO L226 Difference]: Without dead ends: 540 [2019-12-27 18:57:53,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:57:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-27 18:57:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2019-12-27 18:57:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-27 18:57:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2019-12-27 18:57:53,124 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2019-12-27 18:57:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:53,124 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2019-12-27 18:57:53,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:57:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2019-12-27 18:57:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 18:57:53,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:53,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 18:57:53,126 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:53,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash -751398463, now seen corresponding path program 1 times [2019-12-27 18:57:53,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:53,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334408065] [2019-12-27 18:57:53,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:53,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334408065] [2019-12-27 18:57:53,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:53,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:57:53,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113597966] [2019-12-27 18:57:53,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:53,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:53,225 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 7 states and 6 transitions. [2019-12-27 18:57:53,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:53,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:53,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:57:53,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:53,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:57:53,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:57:53,226 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2019-12-27 18:57:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:53,439 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2019-12-27 18:57:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:57:53,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-27 18:57:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:53,444 INFO L225 Difference]: With dead ends: 599 [2019-12-27 18:57:53,444 INFO L226 Difference]: Without dead ends: 514 [2019-12-27 18:57:53,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:57:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-27 18:57:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2019-12-27 18:57:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-27 18:57:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2019-12-27 18:57:53,463 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2019-12-27 18:57:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:53,464 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2019-12-27 18:57:53,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:57:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2019-12-27 18:57:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 18:57:53,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:53,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:53,466 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:53,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:53,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1452138275, now seen corresponding path program 1 times [2019-12-27 18:57:53,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:53,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332487833] [2019-12-27 18:57:53,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:53,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332487833] [2019-12-27 18:57:53,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:53,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:57:53,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2117195011] [2019-12-27 18:57:53,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:53,555 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:53,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 18:57:53,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:53,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:57:53,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:57:53,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:53,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:57:53,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:57:53,594 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 5 states. [2019-12-27 18:57:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:53,691 INFO L93 Difference]: Finished difference Result 186 states and 391 transitions. [2019-12-27 18:57:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:57:53,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-27 18:57:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:53,693 INFO L225 Difference]: With dead ends: 186 [2019-12-27 18:57:53,693 INFO L226 Difference]: Without dead ends: 186 [2019-12-27 18:57:53,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:57:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-27 18:57:53,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2019-12-27 18:57:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 18:57:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2019-12-27 18:57:53,699 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2019-12-27 18:57:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:53,700 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2019-12-27 18:57:53,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:57:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2019-12-27 18:57:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:57:53,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:53,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:53,702 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:53,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2124244464, now seen corresponding path program 1 times [2019-12-27 18:57:53,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:53,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553826782] [2019-12-27 18:57:53,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:54,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553826782] [2019-12-27 18:57:54,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:54,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:57:54,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [486966335] [2019-12-27 18:57:54,002 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:54,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:54,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 32 transitions. [2019-12-27 18:57:54,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:54,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:54,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:57:54,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:54,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:57:54,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:57:54,021 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2019-12-27 18:57:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:54,191 INFO L93 Difference]: Finished difference Result 186 states and 379 transitions. [2019-12-27 18:57:54,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:57:54,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:57:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:54,194 INFO L225 Difference]: With dead ends: 186 [2019-12-27 18:57:54,194 INFO L226 Difference]: Without dead ends: 186 [2019-12-27 18:57:54,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:57:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-27 18:57:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2019-12-27 18:57:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 18:57:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 335 transitions. [2019-12-27 18:57:54,200 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 335 transitions. Word has length 22 [2019-12-27 18:57:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:54,201 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 335 transitions. [2019-12-27 18:57:54,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:57:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 335 transitions. [2019-12-27 18:57:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:57:54,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:54,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:54,209 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:54,210 INFO L82 PathProgramCache]: Analyzing trace with hash 732163342, now seen corresponding path program 1 times [2019-12-27 18:57:54,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:54,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422121016] [2019-12-27 18:57:54,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:54,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422121016] [2019-12-27 18:57:54,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:54,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:57:54,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682747130] [2019-12-27 18:57:54,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:54,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:54,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 32 transitions. [2019-12-27 18:57:54,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:54,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:57:54,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:57:54,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:54,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:57:54,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:57:54,449 INFO L87 Difference]: Start difference. First operand 162 states and 335 transitions. Second operand 7 states. [2019-12-27 18:57:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:55,239 INFO L93 Difference]: Finished difference Result 270 states and 528 transitions. [2019-12-27 18:57:55,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:57:55,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 18:57:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:55,242 INFO L225 Difference]: With dead ends: 270 [2019-12-27 18:57:55,242 INFO L226 Difference]: Without dead ends: 270 [2019-12-27 18:57:55,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:57:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-27 18:57:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 194. [2019-12-27 18:57:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-27 18:57:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 390 transitions. [2019-12-27 18:57:55,249 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 390 transitions. Word has length 22 [2019-12-27 18:57:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:55,249 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 390 transitions. [2019-12-27 18:57:55,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:57:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 390 transitions. [2019-12-27 18:57:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:57:55,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:55,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:55,251 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:55,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:55,251 INFO L82 PathProgramCache]: Analyzing trace with hash -55183662, now seen corresponding path program 2 times [2019-12-27 18:57:55,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:55,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087305806] [2019-12-27 18:57:55,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:56,114 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-12-27 18:57:56,273 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 22 [2019-12-27 18:57:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:56,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087305806] [2019-12-27 18:57:56,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:56,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:57:56,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872827207] [2019-12-27 18:57:56,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:56,871 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:56,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 18:57:56,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:56,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:57:56,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:57:56,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:56,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:57:56,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:57:56,980 INFO L87 Difference]: Start difference. First operand 194 states and 390 transitions. Second operand 17 states. [2019-12-27 18:57:57,593 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-27 18:57:57,808 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-27 18:57:58,054 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-12-27 18:57:58,562 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-12-27 18:57:59,459 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-12-27 18:58:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:00,026 INFO L93 Difference]: Finished difference Result 350 states and 689 transitions. [2019-12-27 18:58:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:58:00,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2019-12-27 18:58:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:00,030 INFO L225 Difference]: With dead ends: 350 [2019-12-27 18:58:00,030 INFO L226 Difference]: Without dead ends: 350 [2019-12-27 18:58:00,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:58:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-27 18:58:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 230. [2019-12-27 18:58:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-27 18:58:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 442 transitions. [2019-12-27 18:58:00,038 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 442 transitions. Word has length 22 [2019-12-27 18:58:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:00,039 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 442 transitions. [2019-12-27 18:58:00,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:58:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 442 transitions. [2019-12-27 18:58:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:00,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:00,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:00,040 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash -55183677, now seen corresponding path program 1 times [2019-12-27 18:58:00,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:00,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763161120] [2019-12-27 18:58:00,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:00,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763161120] [2019-12-27 18:58:00,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:00,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:58:00,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [272666139] [2019-12-27 18:58:00,571 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:00,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:00,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 18:58:00,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:00,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:58:00,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:58:00,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:00,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:58:00,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:58:00,630 INFO L87 Difference]: Start difference. First operand 230 states and 442 transitions. Second operand 10 states. [2019-12-27 18:58:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:01,363 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2019-12-27 18:58:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:58:01,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 18:58:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:01,369 INFO L225 Difference]: With dead ends: 324 [2019-12-27 18:58:01,369 INFO L226 Difference]: Without dead ends: 282 [2019-12-27 18:58:01,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:58:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-27 18:58:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-12-27 18:58:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-27 18:58:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 447 transitions. [2019-12-27 18:58:01,376 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 447 transitions. Word has length 22 [2019-12-27 18:58:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:01,376 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 447 transitions. [2019-12-27 18:58:01,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:58:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 447 transitions. [2019-12-27 18:58:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:01,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:01,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:01,378 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:01,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1284449614, now seen corresponding path program 2 times [2019-12-27 18:58:01,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:01,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342446598] [2019-12-27 18:58:01,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:01,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342446598] [2019-12-27 18:58:01,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:01,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:58:01,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410790019] [2019-12-27 18:58:01,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:01,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:01,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 36 transitions. [2019-12-27 18:58:01,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:01,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:58:01,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:58:01,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:58:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:58:01,649 INFO L87 Difference]: Start difference. First operand 230 states and 447 transitions. Second operand 7 states. [2019-12-27 18:58:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:02,606 INFO L93 Difference]: Finished difference Result 261 states and 498 transitions. [2019-12-27 18:58:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:58:02,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 18:58:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:02,609 INFO L225 Difference]: With dead ends: 261 [2019-12-27 18:58:02,609 INFO L226 Difference]: Without dead ends: 261 [2019-12-27 18:58:02,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:58:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-27 18:58:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 200. [2019-12-27 18:58:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-27 18:58:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 395 transitions. [2019-12-27 18:58:02,618 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 395 transitions. Word has length 22 [2019-12-27 18:58:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:02,618 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 395 transitions. [2019-12-27 18:58:02,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:58:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 395 transitions. [2019-12-27 18:58:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:02,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:02,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:02,619 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:02,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash 497102610, now seen corresponding path program 3 times [2019-12-27 18:58:02,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:02,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373932592] [2019-12-27 18:58:02,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:02,935 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-27 18:58:03,275 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-12-27 18:58:03,440 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-12-27 18:58:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:04,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373932592] [2019-12-27 18:58:04,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:04,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:58:04,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1949546949] [2019-12-27 18:58:04,169 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:04,172 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:04,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 30 transitions. [2019-12-27 18:58:04,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:04,295 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:58:04,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:58:04,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:04,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:58:04,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:58:04,296 INFO L87 Difference]: Start difference. First operand 200 states and 395 transitions. Second operand 17 states. [2019-12-27 18:58:04,680 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 18:58:04,914 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 18:58:05,261 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 18:58:05,538 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-12-27 18:58:05,715 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-12-27 18:58:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:07,102 INFO L93 Difference]: Finished difference Result 306 states and 586 transitions. [2019-12-27 18:58:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 18:58:07,103 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2019-12-27 18:58:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:07,105 INFO L225 Difference]: With dead ends: 306 [2019-12-27 18:58:07,106 INFO L226 Difference]: Without dead ends: 293 [2019-12-27 18:58:07,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:58:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-27 18:58:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 199. [2019-12-27 18:58:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-12-27 18:58:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 393 transitions. [2019-12-27 18:58:07,112 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 393 transitions. Word has length 22 [2019-12-27 18:58:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:07,113 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 393 transitions. [2019-12-27 18:58:07,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:58:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 393 transitions. [2019-12-27 18:58:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:07,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:07,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:07,114 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2050812348, now seen corresponding path program 3 times [2019-12-27 18:58:07,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:07,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910190823] [2019-12-27 18:58:07,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:07,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910190823] [2019-12-27 18:58:07,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:07,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:58:07,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [549168716] [2019-12-27 18:58:07,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:07,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:07,796 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 42 transitions. [2019-12-27 18:58:07,796 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:07,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:58:07,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:58:07,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:07,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:58:07,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:58:07,799 INFO L87 Difference]: Start difference. First operand 199 states and 393 transitions. Second operand 12 states. [2019-12-27 18:58:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:09,928 INFO L93 Difference]: Finished difference Result 420 states and 833 transitions. [2019-12-27 18:58:09,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:58:09,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-27 18:58:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:09,931 INFO L225 Difference]: With dead ends: 420 [2019-12-27 18:58:09,931 INFO L226 Difference]: Without dead ends: 398 [2019-12-27 18:58:09,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:58:09,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-12-27 18:58:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 262. [2019-12-27 18:58:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-27 18:58:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 556 transitions. [2019-12-27 18:58:09,943 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 556 transitions. Word has length 22 [2019-12-27 18:58:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:09,944 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 556 transitions. [2019-12-27 18:58:09,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:58:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 556 transitions. [2019-12-27 18:58:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:09,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:09,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:09,947 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211444, now seen corresponding path program 4 times [2019-12-27 18:58:09,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:09,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884612230] [2019-12-27 18:58:09,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:10,325 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-27 18:58:10,651 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2019-12-27 18:58:10,810 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2019-12-27 18:58:10,935 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-12-27 18:58:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:11,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884612230] [2019-12-27 18:58:11,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:11,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:58:11,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1034008383] [2019-12-27 18:58:11,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:11,559 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:11,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 40 transitions. [2019-12-27 18:58:11,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:11,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:58:11,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:58:11,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:58:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:58:11,620 INFO L87 Difference]: Start difference. First operand 262 states and 556 transitions. Second operand 17 states. [2019-12-27 18:58:12,167 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 18:58:12,526 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 18:58:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:14,018 INFO L93 Difference]: Finished difference Result 393 states and 807 transitions. [2019-12-27 18:58:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 18:58:14,018 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2019-12-27 18:58:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:14,021 INFO L225 Difference]: With dead ends: 393 [2019-12-27 18:58:14,021 INFO L226 Difference]: Without dead ends: 393 [2019-12-27 18:58:14,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:58:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-12-27 18:58:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 278. [2019-12-27 18:58:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-27 18:58:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 578 transitions. [2019-12-27 18:58:14,030 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 578 transitions. Word has length 22 [2019-12-27 18:58:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:14,030 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 578 transitions. [2019-12-27 18:58:14,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:58:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 578 transitions. [2019-12-27 18:58:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:14,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:14,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:14,032 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:14,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211429, now seen corresponding path program 2 times [2019-12-27 18:58:14,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:14,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644284342] [2019-12-27 18:58:14,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:14,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644284342] [2019-12-27 18:58:14,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:14,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:58:14,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [156029759] [2019-12-27 18:58:14,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:14,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:14,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 40 transitions. [2019-12-27 18:58:14,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:14,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:58:14,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:58:14,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:14,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:58:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:58:14,613 INFO L87 Difference]: Start difference. First operand 278 states and 578 transitions. Second operand 9 states. [2019-12-27 18:58:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:15,171 INFO L93 Difference]: Finished difference Result 392 states and 777 transitions. [2019-12-27 18:58:15,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:58:15,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 18:58:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:15,174 INFO L225 Difference]: With dead ends: 392 [2019-12-27 18:58:15,174 INFO L226 Difference]: Without dead ends: 383 [2019-12-27 18:58:15,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:58:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-27 18:58:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 328. [2019-12-27 18:58:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 18:58:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 678 transitions. [2019-12-27 18:58:15,182 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 678 transitions. Word has length 22 [2019-12-27 18:58:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:15,182 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 678 transitions. [2019-12-27 18:58:15,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:58:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 678 transitions. [2019-12-27 18:58:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:15,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:15,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:15,183 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:15,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1515700702, now seen corresponding path program 5 times [2019-12-27 18:58:15,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:15,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712529669] [2019-12-27 18:58:15,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:15,481 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-27 18:58:15,611 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-27 18:58:15,743 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-27 18:58:15,957 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-12-27 18:58:16,166 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-12-27 18:58:16,323 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-12-27 18:58:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:16,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712529669] [2019-12-27 18:58:16,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:16,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:58:16,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1073361798] [2019-12-27 18:58:16,839 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:16,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:16,850 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 18:58:16,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:16,852 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:58:16,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:58:16,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:58:16,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:58:16,853 INFO L87 Difference]: Start difference. First operand 328 states and 678 transitions. Second operand 16 states. [2019-12-27 18:58:17,350 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-12-27 18:58:17,687 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 18:58:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:18,891 INFO L93 Difference]: Finished difference Result 446 states and 910 transitions. [2019-12-27 18:58:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 18:58:18,892 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 18:58:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:18,895 INFO L225 Difference]: With dead ends: 446 [2019-12-27 18:58:18,895 INFO L226 Difference]: Without dead ends: 431 [2019-12-27 18:58:18,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:58:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-27 18:58:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 324. [2019-12-27 18:58:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-27 18:58:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 670 transitions. [2019-12-27 18:58:18,903 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 670 transitions. Word has length 22 [2019-12-27 18:58:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:18,904 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 670 transitions. [2019-12-27 18:58:18,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:58:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 670 transitions. [2019-12-27 18:58:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:18,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:18,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:18,905 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash 718214449, now seen corresponding path program 3 times [2019-12-27 18:58:18,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:18,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916660575] [2019-12-27 18:58:18,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:19,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916660575] [2019-12-27 18:58:19,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:19,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:58:19,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2022475868] [2019-12-27 18:58:19,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:19,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:19,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 18:58:19,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:19,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:58:19,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:58:19,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:58:19,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:58:19,639 INFO L87 Difference]: Start difference. First operand 324 states and 670 transitions. Second operand 11 states. [2019-12-27 18:58:19,977 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-27 18:58:20,158 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-27 18:58:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:21,079 INFO L93 Difference]: Finished difference Result 340 states and 691 transitions. [2019-12-27 18:58:21,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:58:21,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 18:58:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:21,082 INFO L225 Difference]: With dead ends: 340 [2019-12-27 18:58:21,083 INFO L226 Difference]: Without dead ends: 328 [2019-12-27 18:58:21,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-12-27 18:58:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-27 18:58:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 306. [2019-12-27 18:58:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-27 18:58:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 645 transitions. [2019-12-27 18:58:21,090 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 645 transitions. Word has length 22 [2019-12-27 18:58:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:21,090 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 645 transitions. [2019-12-27 18:58:21,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:58:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 645 transitions. [2019-12-27 18:58:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:21,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:21,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:21,092 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:21,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1341843718, now seen corresponding path program 6 times [2019-12-27 18:58:21,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:21,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612391759] [2019-12-27 18:58:21,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:22,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612391759] [2019-12-27 18:58:22,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:22,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:58:22,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [493491117] [2019-12-27 18:58:22,411 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:22,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:22,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 18:58:22,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:22,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:58:22,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:58:22,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 18:58:22,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 18:58:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:58:22,788 INFO L87 Difference]: Start difference. First operand 306 states and 645 transitions. Second operand 18 states. [2019-12-27 18:58:23,122 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 18:58:23,356 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 18:58:23,753 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 18:58:24,591 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 32 [2019-12-27 18:58:24,942 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 34 [2019-12-27 18:58:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:25,577 INFO L93 Difference]: Finished difference Result 459 states and 930 transitions. [2019-12-27 18:58:25,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:58:25,577 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-12-27 18:58:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:25,580 INFO L225 Difference]: With dead ends: 459 [2019-12-27 18:58:25,580 INFO L226 Difference]: Without dead ends: 437 [2019-12-27 18:58:25,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:58:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-27 18:58:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 294. [2019-12-27 18:58:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-27 18:58:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 626 transitions. [2019-12-27 18:58:25,588 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 626 transitions. Word has length 22 [2019-12-27 18:58:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:25,588 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 626 transitions. [2019-12-27 18:58:25,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 18:58:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 626 transitions. [2019-12-27 18:58:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:25,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:25,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:25,590 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:25,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1650245952, now seen corresponding path program 7 times [2019-12-27 18:58:25,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:25,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031230897] [2019-12-27 18:58:25,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:25,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031230897] [2019-12-27 18:58:25,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:25,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:58:25,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1228748377] [2019-12-27 18:58:25,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:25,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:25,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 55 transitions. [2019-12-27 18:58:25,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:25,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:25,872 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:25,876 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:25,881 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:25,884 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:25,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:25,959 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:25,963 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:25,967 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:25,972 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:25,976 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:26,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:26,001 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-27 18:58:26,001 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:185, output treesize:20 [2019-12-27 18:58:26,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:58:26,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:58:26,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:26,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:58:26,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:58:26,003 INFO L87 Difference]: Start difference. First operand 294 states and 626 transitions. Second operand 7 states. [2019-12-27 18:58:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:26,379 INFO L93 Difference]: Finished difference Result 106 states and 178 transitions. [2019-12-27 18:58:26,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:58:26,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 18:58:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:26,380 INFO L225 Difference]: With dead ends: 106 [2019-12-27 18:58:26,381 INFO L226 Difference]: Without dead ends: 106 [2019-12-27 18:58:26,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:58:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-27 18:58:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-12-27 18:58:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-27 18:58:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 178 transitions. [2019-12-27 18:58:26,384 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 178 transitions. Word has length 22 [2019-12-27 18:58:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:26,385 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 178 transitions. [2019-12-27 18:58:26,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:58:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 178 transitions. [2019-12-27 18:58:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:26,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:26,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:26,386 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash -936962176, now seen corresponding path program 8 times [2019-12-27 18:58:26,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:26,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101861480] [2019-12-27 18:58:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:26,923 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-27 18:58:27,055 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2019-12-27 18:58:27,290 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-12-27 18:58:27,468 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2019-12-27 18:58:27,625 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 28 [2019-12-27 18:58:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:28,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101861480] [2019-12-27 18:58:28,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:28,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:58:28,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [393411854] [2019-12-27 18:58:28,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:28,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:28,274 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 18:58:28,275 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:28,494 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,499 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,504 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,508 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,511 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,515 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,521 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,525 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:28,630 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,637 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,640 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,645 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,649 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,654 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,662 INFO L534 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,666 INFO L534 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:28,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:28,698 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2019-12-27 18:58:28,698 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:310, output treesize:46 [2019-12-27 18:58:28,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:58:28,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:58:28,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:28,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:58:28,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:58:28,782 INFO L87 Difference]: Start difference. First operand 106 states and 178 transitions. Second operand 20 states. [2019-12-27 18:58:29,470 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-12-27 18:58:29,933 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-12-27 18:58:30,116 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-12-27 18:58:30,420 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-12-27 18:58:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:31,340 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-12-27 18:58:31,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:58:31,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-12-27 18:58:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:31,342 INFO L225 Difference]: With dead ends: 147 [2019-12-27 18:58:31,342 INFO L226 Difference]: Without dead ends: 147 [2019-12-27 18:58:31,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:58:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-27 18:58:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-12-27 18:58:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-27 18:58:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 239 transitions. [2019-12-27 18:58:31,346 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 239 transitions. Word has length 22 [2019-12-27 18:58:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:31,346 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 239 transitions. [2019-12-27 18:58:31,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:58:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 239 transitions. [2019-12-27 18:58:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:31,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:31,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:31,347 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash -936962191, now seen corresponding path program 4 times [2019-12-27 18:58:31,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:31,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051348839] [2019-12-27 18:58:31,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:31,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051348839] [2019-12-27 18:58:31,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:31,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:58:31,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103466709] [2019-12-27 18:58:31,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:31,867 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:31,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 18:58:31,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:31,875 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:58:31,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:58:31,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:58:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:58:31,876 INFO L87 Difference]: Start difference. First operand 146 states and 239 transitions. Second operand 9 states. [2019-12-27 18:58:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:32,488 INFO L93 Difference]: Finished difference Result 176 states and 285 transitions. [2019-12-27 18:58:32,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:58:32,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 18:58:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:32,490 INFO L225 Difference]: With dead ends: 176 [2019-12-27 18:58:32,490 INFO L226 Difference]: Without dead ends: 134 [2019-12-27 18:58:32,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:58:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-27 18:58:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-12-27 18:58:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-27 18:58:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 217 transitions. [2019-12-27 18:58:32,495 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 217 transitions. Word has length 22 [2019-12-27 18:58:32,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:32,495 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 217 transitions. [2019-12-27 18:58:32,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:58:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 217 transitions. [2019-12-27 18:58:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:32,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:32,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:32,496 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash 590296588, now seen corresponding path program 9 times [2019-12-27 18:58:32,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:32,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713100550] [2019-12-27 18:58:32,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:33,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713100550] [2019-12-27 18:58:33,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:33,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:58:33,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1705817772] [2019-12-27 18:58:33,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:33,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:33,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 56 transitions. [2019-12-27 18:58:33,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:34,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,150 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,154 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,158 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,164 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,169 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,179 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,184 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,315 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-27 18:58:34,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:34,320 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,324 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,328 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,333 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,338 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,343 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,348 INFO L534 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,351 INFO L534 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:34,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:34,388 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2019-12-27 18:58:34,388 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:310, output treesize:46 [2019-12-27 18:58:34,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:58:34,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 18:58:34,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 18:58:34,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:58:34,729 INFO L87 Difference]: Start difference. First operand 134 states and 217 transitions. Second operand 23 states. [2019-12-27 18:58:35,518 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-12-27 18:58:35,695 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-12-27 18:58:36,215 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-12-27 18:58:36,387 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-12-27 18:58:36,652 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 18:58:37,166 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-12-27 18:58:37,407 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2019-12-27 18:58:37,759 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-12-27 18:58:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:38,235 INFO L93 Difference]: Finished difference Result 190 states and 300 transitions. [2019-12-27 18:58:38,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:58:38,236 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-12-27 18:58:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:38,237 INFO L225 Difference]: With dead ends: 190 [2019-12-27 18:58:38,237 INFO L226 Difference]: Without dead ends: 153 [2019-12-27 18:58:38,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 18:58:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-27 18:58:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2019-12-27 18:58:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-27 18:58:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 226 transitions. [2019-12-27 18:58:38,241 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 226 transitions. Word has length 22 [2019-12-27 18:58:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:38,241 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 226 transitions. [2019-12-27 18:58:38,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 18:58:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 226 transitions. [2019-12-27 18:58:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:38,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:38,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:38,242 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash 590296573, now seen corresponding path program 5 times [2019-12-27 18:58:38,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:38,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092157679] [2019-12-27 18:58:38,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:38,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092157679] [2019-12-27 18:58:38,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:38,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:58:38,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [753324488] [2019-12-27 18:58:38,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:38,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:38,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 56 transitions. [2019-12-27 18:58:38,727 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:38,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:58:38,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:58:38,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:38,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:58:38,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:58:38,838 INFO L87 Difference]: Start difference. First operand 144 states and 226 transitions. Second operand 11 states. [2019-12-27 18:58:39,260 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-12-27 18:58:39,410 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-27 18:58:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:39,796 INFO L93 Difference]: Finished difference Result 143 states and 224 transitions. [2019-12-27 18:58:39,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:58:39,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 18:58:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:39,797 INFO L225 Difference]: With dead ends: 143 [2019-12-27 18:58:39,797 INFO L226 Difference]: Without dead ends: 113 [2019-12-27 18:58:39,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:58:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-27 18:58:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2019-12-27 18:58:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-27 18:58:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 154 transitions. [2019-12-27 18:58:39,800 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 154 transitions. Word has length 22 [2019-12-27 18:58:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:39,800 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 154 transitions. [2019-12-27 18:58:39,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:58:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 154 transitions. [2019-12-27 18:58:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:39,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:39,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:39,802 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:39,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1516658228, now seen corresponding path program 10 times [2019-12-27 18:58:39,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:39,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499416639] [2019-12-27 18:58:39,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:40,102 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-27 18:58:40,228 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-27 18:58:40,359 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-27 18:58:40,486 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-12-27 18:58:40,764 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 26 [2019-12-27 18:58:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:41,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499416639] [2019-12-27 18:58:41,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:41,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:58:41,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [460260469] [2019-12-27 18:58:41,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:41,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:41,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 18:58:41,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:41,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,582 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,586 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,590 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,595 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,600 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,604 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,609 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:41,708 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,713 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,717 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,721 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,726 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,730 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,733 INFO L534 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,738 INFO L534 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:41,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:41,771 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2019-12-27 18:58:41,771 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:310, output treesize:46 [2019-12-27 18:58:42,015 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:58:42,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:58:42,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:42,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:58:42,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:58:42,016 INFO L87 Difference]: Start difference. First operand 99 states and 154 transitions. Second operand 22 states. [2019-12-27 18:58:42,776 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-12-27 18:58:43,276 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-12-27 18:58:43,920 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 18:58:44,241 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-27 18:58:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:44,765 INFO L93 Difference]: Finished difference Result 126 states and 190 transitions. [2019-12-27 18:58:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:58:44,765 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-12-27 18:58:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:44,766 INFO L225 Difference]: With dead ends: 126 [2019-12-27 18:58:44,766 INFO L226 Difference]: Without dead ends: 106 [2019-12-27 18:58:44,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:58:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-27 18:58:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-12-27 18:58:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-27 18:58:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 146 transitions. [2019-12-27 18:58:44,770 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 146 transitions. Word has length 22 [2019-12-27 18:58:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:44,771 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 146 transitions. [2019-12-27 18:58:44,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:58:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 146 transitions. [2019-12-27 18:58:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:44,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:44,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:44,772 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:44,772 INFO L82 PathProgramCache]: Analyzing trace with hash -835410036, now seen corresponding path program 11 times [2019-12-27 18:58:44,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:44,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484186203] [2019-12-27 18:58:44,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:46,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484186203] [2019-12-27 18:58:46,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:46,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:58:46,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1997313104] [2019-12-27 18:58:46,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:46,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:46,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 62 transitions. [2019-12-27 18:58:46,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:46,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,215 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,220 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,249 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,255 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,258 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,262 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,268 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:46,369 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,373 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,377 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,381 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,384 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,389 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,393 INFO L534 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,396 INFO L534 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:46,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:46,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2019-12-27 18:58:46,427 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:311, output treesize:47 [2019-12-27 18:58:46,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:58:46,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 18:58:46,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:46,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 18:58:46,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-12-27 18:58:46,646 INFO L87 Difference]: Start difference. First operand 97 states and 146 transitions. Second operand 21 states. [2019-12-27 18:58:47,323 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-12-27 18:58:47,775 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-12-27 18:58:48,184 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-27 18:58:48,377 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-27 18:58:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:48,969 INFO L93 Difference]: Finished difference Result 112 states and 163 transitions. [2019-12-27 18:58:48,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:58:48,969 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-12-27 18:58:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:48,970 INFO L225 Difference]: With dead ends: 112 [2019-12-27 18:58:48,970 INFO L226 Difference]: Without dead ends: 47 [2019-12-27 18:58:48,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:58:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-27 18:58:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-12-27 18:58:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 18:58:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2019-12-27 18:58:48,971 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 22 [2019-12-27 18:58:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:48,972 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2019-12-27 18:58:48,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 18:58:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2019-12-27 18:58:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:58:48,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:48,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:48,972 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:48,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:48,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2127826590, now seen corresponding path program 12 times [2019-12-27 18:58:48,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:48,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540739081] [2019-12-27 18:58:48,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:49,265 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-27 18:58:49,674 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2019-12-27 18:58:49,839 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2019-12-27 18:58:49,979 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2019-12-27 18:58:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:50,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540739081] [2019-12-27 18:58:50,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:50,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:58:50,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1804446330] [2019-12-27 18:58:50,578 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:50,583 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:50,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 36 transitions. [2019-12-27 18:58:50,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:50,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-27 18:58:50,815 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-27 18:58:51,008 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 18:58:51,232 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 18:58:51,250 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,256 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,262 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,268 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,275 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,279 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,284 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,289 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,492 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 18:58:51,492 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:51,497 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,501 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,507 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,513 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,519 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,530 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,536 INFO L534 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,542 INFO L534 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-12-27 18:58:51,697 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-27 18:58:51,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:51,699 INFO L534 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. [2019-12-27 18:58:51,700 INFO L239 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:401, output treesize:145 [2019-12-27 18:58:51,907 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-27 18:58:51,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:58:51,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:58:51,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:51,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:58:51,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:58:51,910 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 20 states. [2019-12-27 18:58:52,353 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-12-27 18:58:52,690 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 42 [2019-12-27 18:58:53,030 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 44 [2019-12-27 18:58:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:53,705 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-12-27 18:58:53,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:58:53,706 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-12-27 18:58:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:53,706 INFO L225 Difference]: With dead ends: 37 [2019-12-27 18:58:53,706 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 18:58:53,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:58:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 18:58:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 18:58:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 18:58:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 18:58:53,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-27 18:58:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:53,708 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 18:58:53,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:58:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 18:58:53,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 18:58:53,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:58:53 BasicIcfg [2019-12-27 18:58:53,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:58:53,714 INFO L168 Benchmark]: Toolchain (without parser) took 127213.05 ms. Allocated memory was 139.5 MB in the beginning and 342.9 MB in the end (delta: 203.4 MB). Free memory was 100.6 MB in the beginning and 293.2 MB in the end (delta: -192.6 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:53,714 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 18:58:53,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1425.18 ms. Allocated memory was 139.5 MB in the beginning and 235.9 MB in the end (delta: 96.5 MB). Free memory was 100.2 MB in the beginning and 168.8 MB in the end (delta: -68.6 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:53,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.17 ms. Allocated memory is still 235.9 MB. Free memory was 168.8 MB in the beginning and 165.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:53,716 INFO L168 Benchmark]: Boogie Preprocessor took 47.85 ms. Allocated memory is still 235.9 MB. Free memory was 165.3 MB in the beginning and 161.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:53,716 INFO L168 Benchmark]: RCFGBuilder took 881.19 ms. Allocated memory is still 235.9 MB. Free memory was 161.9 MB in the beginning and 114.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:53,716 INFO L168 Benchmark]: TraceAbstraction took 124768.98 ms. Allocated memory was 235.9 MB in the beginning and 342.9 MB in the end (delta: 107.0 MB). Free memory was 113.2 MB in the beginning and 293.2 MB in the end (delta: -180.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 18:58:53,718 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1425.18 ms. Allocated memory was 139.5 MB in the beginning and 235.9 MB in the end (delta: 96.5 MB). Free memory was 100.2 MB in the beginning and 168.8 MB in the end (delta: -68.6 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.17 ms. Allocated memory is still 235.9 MB. Free memory was 168.8 MB in the beginning and 165.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.85 ms. Allocated memory is still 235.9 MB. Free memory was 165.3 MB in the beginning and 161.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 881.19 ms. Allocated memory is still 235.9 MB. Free memory was 161.9 MB in the beginning and 114.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124768.98 ms. Allocated memory was 235.9 MB in the beginning and 342.9 MB in the end (delta: 107.0 MB). Free memory was 113.2 MB in the beginning and 293.2 MB in the end (delta: -180.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 63.0s, 151 ProgramPointsBefore, 41 ProgramPointsAfterwards, 155 TransitionsBefore, 41 TransitionsAfterwards, 2884 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 16 ConcurrentYvCompositions, 5 ChoiceCompositions, 1460 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 22 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 49.6s, 0 MoverChecksTotal, 5217 CheckedPairsTotal, 160 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Result: SAFE, OverallTime: 124.5s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 652 SDtfs, 1433 SDslu, 2683 SDs, 0 SdLazy, 7967 SolverSat, 650 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 516 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 36.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 1199 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 169351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...